The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
From MaRDI portal
Publication:1652112
DOI10.1016/J.COR.2015.12.017zbMath1391.90102OpenAlexW2231755997MaRDI QIDQ1652112
Gábor Nagy, Naveed Wassan, Niaz A. Wassan, Said Salhi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/54046/1/VNS%20paper_revision%20Nov10-2015.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
The multiple trip vehicle routing problem with backhauls in random fuzzy environment: using (α,β)-cost minimization model under the Hurwicz criterion ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ A matheuristic for solving inventory sharing problems ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach ⋮ Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
Uses Software
Cites Work
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
- Two level general variable neighborhood search for attractive traveling salesman problem
- Skewed general variable neighborhood search for the location routing scheduling problem
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A GA based heuristic for the vehicle routing problem with multiple trips
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- The vehicle routing problem with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Variable neighborhood search
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A memetic algorithm for the multi trip vehicle routing problem
- An iterated local search algorithm for the vehicle routing problem with backhauls
- An Exact Method for the Vehicle Routing Problem with Backhauls
- The multi-trip vehicle routing problem
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Vehicle Routeing with Multiple Use of Vehicles
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
This page was built for publication: The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
