Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
From MaRDI portal
Publication:2275601
DOI10.1016/j.ejor.2010.11.011zbMath1218.90037OpenAlexW2086482341MaRDI QIDQ2275601
Gregorio Tirado, Angel Felipe, M. Teresa Ortuño
Publication date: 9 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.011
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ An adapted heuristic approach for a clustered traveling salesman problem with loading constraints ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ An infeasible space exploring matheuristic for the production routing problem ⋮ A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Cites Work
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- Variable neighbourhood search: methods and applications
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- Variable neighborhood search
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch
- An exact method for the double TSP with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- On the Complexity of the Multiple Stack TSP, kSTSP
- On Utilizing Infeasibility in Multiobjective Evolutionary Algorithms
- A guide to vehicle routing heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A tabu search heuristic for the generalized assignment problem
This page was built for publication: Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
