Metaheuristics for the vehicle routing problem with loading constraints
From MaRDI portal
Publication:5295486
DOI10.1002/net.20179zbMath1141.90336OpenAlexW4242072154WikidataQ59389750 ScholiaQ59389750MaRDI QIDQ5295486
Manuel Iori, Karl F. Doerner, Guenther Fuellerer, Manfred Gronalt, Richard F. Hartl
Publication date: 30 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20179
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, Rich vehicle routing problems: from a taxonomy to a definition, New neighborhood structures for the double traveling salesman problem with multiple stacks, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks, Routing problems with loading constraints, The pallet-loading vehicle routing problem with stability constraints, Finished-vehicle transporter routing problem solved by loading pattern discovery, Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, Heuristic and exact algorithms for the multi-pile vehicle routing problem, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks, Ant colony optimization for the two-dimensional loading vehicle routing problem, 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, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, 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, Container loading with multi-drop constraints, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, Integrated distribution and loading planning via a compact metaheuristic algorithm, Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Cites Work
