A mathematical programming-based heuristic for the production routing problem with transshipments.
Mustafa AvciSeyda TopalogluPublished in: Comput. Oper. Res. (2020)
Keyphrases
- mathematical programming
- routing problem
- vehicle routing problem
- combinatorial optimization
- tabu search
- mixed integer linear
- benchmark instances
- variable neighborhood search
- tree search
- traveling salesman problem
- metaheuristic
- linear programming
- simulated annealing
- scatter search
- cell suppression
- mip solver
- capacity expansion
- multicommodity flow
- search strategies
- optimal solution
- search procedure
- travel time
- service level
- routing algorithm
- feasible solution
- shortest path
- optimization problems
- np hard
- production planning
- scheduling problem
- search algorithm
- benchmark problems
- dynamic programming
- mixed integer programming
- exact algorithms