Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
DOI10.1016/J.EJOR.2010.11.011zbMATH Open1218.90037OpenAlexW2086482341MaRDI QIDQ2275601FDOQ2275601
Authors: Angel Felipe, M. T. Ortuño, Gregorio Tirado 
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
Recommendations
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- Metaheuristics for the vehicle routing problem with loading constraints
- An integrated approach to the vehicle routing and container loading problems
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A tabu search heuristic for the generalized assignment problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- 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
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- On the Complexity of the Multiple Stack TSP, kSTSP
- A guide to vehicle routing heuristics
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- On utilizing infeasibility in multiobjective evolutionary algorithms
Cited In (6)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- An infeasible space exploring matheuristic for the production routing problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
This page was built for publication: Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275601)
