A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
Publication:609809
DOI10.1016/J.COR.2010.08.017zbMath1201.90026OpenAlexW2000388551MaRDI QIDQ609809
Hélène Toussaint, Philippe Lacomme, Alain Quilliot, Christophe Duhamel
Publication date: 1 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.017
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Scheduling subject to resource constraints: Classification and complexity
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Resource-constrained project scheduling: A survey of recent developments.
- Project scheduling. A research handbook.
- Greedy randomized adaptive search procedures
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A hybrid metaheuristic for the resource-constrained project scheduling problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Packing problems and project scheduling models: an integrating perspective
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Routing a Heterogeneous Fleet of Vehicles
- The Three-Dimensional Bin Packing Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem