A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
From MaRDI portal
Publication:1417560
DOI10.1016/S0166-218X(03)00434-7zbMath1053.90026OpenAlexW2051181280WikidataQ60059906 ScholiaQ60059906MaRDI QIDQ1417560
Publication date: 5 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00434-7
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times, An optimization approach for communal home meal delivery service: A case study, Rich vehicle routing problems: from a taxonomy to a definition, A variable neighborhood search algorithm for the vehicle routing problem with multiple trips, Multi-trip vehicle routing problem with order release time, Adaptive memory programming for the vehicle routing problem with multiple trips, Large neighborhood search for multi-trip vehicle routing, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, Skewed general variable neighborhood search for the location routing scheduling problem, Solving the bus evacuation problem and its variants, The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up, The multi-period multi-trip container drayage problem with release and due dates, A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes, A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations, Routing Courier Delivery Services with Urgent Demand, Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows, Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model, Vehicle routing problems with multiple trips, A GA based heuristic for the vehicle routing problem with multiple trips, Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети, Vehicle routing problems with multiple trips, Vehicle routing problem for multiple product types, compartments, and trips with soft time windows, Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints, The multi-shift vehicle routing problem with overtime, Multi-trip time-dependent vehicle routing problem with time windows, A memetic algorithm for the multi trip vehicle routing problem, An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem, An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
Uses Software
Cites Work
- Unnamed Item
- Heuristic algorithms for the multiple knapsack problem
- 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
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Probabilistic diversification and intensification in local search for vehicle routing
- The multi-trip vehicle routing problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Vehicle Routeing with Multiple Use of Vehicles
