A general vehicle routing problem

DOI10.1016/j.ejor.2006.12.065zbMath1160.90343OpenAlexW2095906270WikidataQ58761669 ScholiaQ58761669MaRDI QIDQ932181

Asvin Goel, Volker Gruhn

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32732

zbMATH Keywords

vehicle routing problemlarge neighbourhood searchpickup and delivery problemvariable neighbourhood search

Mathematics Subject Classification ID

Search theory (90B40) Traffic problems in operations research (90B20)

Related Items

Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Dynamic vehicle routing using an improved variable neighborhood search algorithm ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ Dynamic design of sales territories ⋮ Fair division in the presence of externalities ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ A new mixed integer linear model for a rich vehicle routing problem with docking constraints ⋮ The sales force sizing problem with multi-period workload assignments, and service time windows ⋮ Dynamic vehicle routing problems with enhanced ant colony optimization ⋮ A hybrid ant colony optimization for dynamic multidepot vehicle routing problem ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Dynamic courier routing for a food delivery service ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ Variable neighbourhood search: methods and applications ⋮ An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ Variable neighbourhood search: Methods and applications ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ Workforce routing and scheduling for electricity network maintenance with downtime minimization

Cites Work

• Variable neighborhood search
• A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
• Dynamic vehicle routing: Status and prospects
• Drive: Dynamic Routing of Independent Vehicles
• Adaptive Labeling Algorithms for the Dynamic Assignment Problem
• The General Pickup and Delivery Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item