A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
DOI10.1016/J.COR.2010.08.017zbMATH Open1201.90026OpenAlexW2000388551MaRDI QIDQ609809FDOQ609809
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
Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)
Cites Work
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Scheduling subject to resource constraints: Classification and complexity
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Resource-constrained project scheduling: A survey of recent developments.
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Title not available (Why is that?)
- Greedy randomized adaptive search procedures
- Exact solution of the two-dimensional finite bin packing problem
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Routing a Heterogeneous Fleet of Vehicles
- The Three-Dimensional Bin Packing Problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- A hybrid metaheuristic for the resource-constrained project scheduling problem
- Title not available (Why is that?)
- Competitive memetic algorithms for arc routing problems
- Packing problems and project scheduling models: an integrating perspective
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Title not available (Why is that?)
Cited In (27)
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- The value of integrating loading and routing
- A heuristic algorithm for solving triangle packing problem
- Column generation based primal heuristics for routing and loading problems
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Solving a large multicontainer loading problem in the car manufacturing industry
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- The pallet-loading vehicle routing problem with stability constraints
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture
Uses Software
Recommendations
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints 👍 👎
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints 👍 👎
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem 👍 👎
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints 👍 👎
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints 👍 👎
This page was built for publication: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609809)