Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

From MaRDI portal
Revision as of 04:05, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:439444

DOI10.1016/J.EJOR.2011.07.037zbMath1244.90001OpenAlexW2018691209MaRDI QIDQ439444

Roberto Baldacci, Aristide Mingozzi, Roberto Roberti

Publication date: 16 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.037


zbMATH Keywords

surveyvehicle routingexact algorithms


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (67)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Solving the petroleum replenishment and routing problem with variable demands and time windows ⋮ Branch-and-price and constraint programming for solving a real-life technician dispatching problem ⋮ Min-Max vs. Min-Sum vehicle routing: a worst-case analysis ⋮ Ensuring service levels in routing problems with time windows and stochastic travel times ⋮ A survey of variants and extensions of the location-routing problem ⋮ A variable neighborhood search branching for the electric vehicle routing problem with time windows ⋮ The discrete time window assignment vehicle routing problem ⋮ An ant colony system for responsive dynamic vehicle routing ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size ⋮ A vehicle routing problem with flexible time windows ⋮ A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account ⋮ Special issue on vehicle routing and scheduling: recent trends and advances ⋮ Routing optimization with time windows under uncertainty ⋮ A matheuristic for the asymmetric capacitated vehicle routing problem ⋮ The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach ⋮ A column generation-based heuristic for a rehabilitation patient scheduling and routing problem ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ The vehicle routing problem with release dates and flexible time windows ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ Designing granular solution methods for routing problems with time windows ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ A two-stage decision-support approach for improving sustainable last-mile cold chain logistics operations of COVID-19 vaccines ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows ⋮ The Vehicle Routing Problem with Release and Due Dates ⋮ Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ Solving elementary shortest-path problems as mixed-integer programs ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints ⋮ Exact methods for solving the elementary shortest and longest path problems ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ The separation problem of rounded capacity inequalities: some polynomial cases ⋮ On the complexity of the separation problem for rounded capacity inequalities ⋮ Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ A column generation algorithm for the vehicle routing problem with soft time windows ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem ⋮ Tabu search for the time-dependent vehicle routing problem with time windows on a road network ⋮ Scheduling issues in vehicle routing ⋮ Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments ⋮ Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem ⋮ Vehicle routing with transportable resources: using carpooling and walking for on-site services ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ A CVRP model for an in-plant milk run system ⋮ Synchronous routing for personal rapid transit pods ⋮ A matheuristic for the truck and trailer routing problem ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach


Uses Software



Cites Work




This page was built for publication: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:439444&oldid=12314070"
Powered by MediaWiki