4.7 Article

Small and large neighborhood search for the park-and-loop routing problem with parking selection

Related references

Note: Only part of the references are listed.
Review Management

Two-echelon vehicle routing problems: A literature review

Natasja Sluijk et al.

Summary: The two-echelon vehicle routing problem (2E-VRP) involves splitting the distribution network into two levels. This review examines the literature on 2E-VRP, including mathematical formulations, solution methods, and benchmark datasets, emphasizing the academic and practical significance of 2E-VRP.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Computer Science, Interdisciplinary Applications

The doubly open park-and-loop routing problem

Nicolas Cabrera et al.

Summary: This paper introduces a highly efficient heuristic for the doubly open park-and-loop routing problem, which can generate high-quality solutions quickly.

COMPUTERS & OPERATIONS RESEARCH (2022)

Review Management

Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review

Hongqi Li et al.

Summary: This article discusses the optimization of GV and UAV systems, with GVs acting as mobile satellites and UAVs dispatched from GVs for last-mile deliveries. It addresses routing optimization issues between GVs and UAVs using a two-echelon scheme, including satellite synchronization and vehicle coupling/decoupling.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Article Economics

A large neighborhood search approach to the vehicle routing problem with delivery options

Dorian Dumez et al.

Summary: This article proposes a solution for last mile delivery with multiple delivery options, successfully addressing specific cases of vehicle routing problems through large neighborhood search and specific operators.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)

Article Operations Research & Management Science

Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows

Dorian Dumez et al.

Summary: Delivery options are essential in the generalized vehicle routing problem with time windows, allowing for more flexibility and efficiency in serving customers. The study introduces a matheuristic approach that combines large neighborhood search with problem-tailored destruction operators to find optimal solutions, achieving competitive results with previous state-of-the-art methods.

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS (2021)

Article Operations Research & Management Science

Slack Induction by String Removals for Vehicle Routing Problems

Jan Christiaens et al.

TRANSPORTATION SCIENCE (2020)

Article Operations Research & Management Science

A Policy-Sensitive Model of Parking Choice for Commercial Vehicles in Urban Areas

Giacomo Dalla Chiara et al.

TRANSPORTATION SCIENCE (2020)

Article Operations Research & Management Science

Optimised solutions to the last-mile delivery problem in London using a combination of walking and driving

Antonio Martinez-Sykora et al.

ANNALS OF OPERATIONS RESEARCH (2020)

Article Management

Vehicle routing with transportable resources: Using carpooling and walking for on-site services

Marc-Antoine Coindreau et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Article Operations Research & Management Science

Optimization Approaches for the Traveling Salesman Problem with Drone

Niels Agatz et al.

TRANSPORTATION SCIENCE (2018)

Article Computer Science, Interdisciplinary Applications

Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows

Sophie N. Parragh et al.

COMPUTERS & OPERATIONS RESEARCH (2017)

Article Operations Research & Management Science

Intermediate Facilities in Freight Transportation Planning: A Survey

G. Guastaroba et al.

TRANSPORTATION SCIENCE (2016)

Article Computer Science, Interdisciplinary Applications

A survey on two-echelon routing problems

R. Cuda et al.

COMPUTERS & OPERATIONS RESEARCH (2015)

Article Green & Sustainable Science & Technology

A matheuristic for routing real-world home service transport systems facilitating walking

Christian Fikar et al.

JOURNAL OF CLEANER PRODUCTION (2015)

Article Operations Research & Management Science

Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers

Gerald Senarclens de Grancy et al.

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2015)

Article Computer Science, Interdisciplinary Applications

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

Vera C. Hemmelmayr et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

Article Management

Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW

Vitoria Pureza et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)

Article Operations Research & Management Science

Models for Evaluating and Planning City Logistics Systems

Teodor Gabriel Crainic et al.

TRANSPORTATION SCIENCE (2009)

Article Management

Solution of real-world postman problems

Stefan Irnich

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)

Article Computer Science, Interdisciplinary Applications

A general heuristic for vehicle routing problems

David Pisinger et al.

COMPUTERS & OPERATIONS RESEARCH (2007)

Article Operations Research & Management Science

An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows

Stefan Ropke et al.

TRANSPORTATION SCIENCE (2006)

Article Management

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

S Ropke et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Article Computer Science, Interdisciplinary Applications

Record breaking optimization results using the ruin and recreate principle

G Schrimpf et al.

JOURNAL OF COMPUTATIONAL PHYSICS (2000)