An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
type: Item
instance of: scholarly article
title: An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
zbMATH Open document ID: 1391.90062
author: Axel Grimault
author: Nathalie Bostel
author: Fabien Lehuédé
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 6902756
zbMATH Keywords: vehicle routing
zbMATH Keywords: full truckload
zbMATH Keywords: adaptive large neighborhood search
zbMATH Keywords: synchronization
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2017.06.012
OpenAlex ID: W2667856372
cites work: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
cites work: Analysis, modeling and solution of the concrete delivery problem
cites work: Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Q3425131
cites work: A local search heuristic for the pre- and end-haulage of intermodal container terminals
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
cites work: A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem
cites work: Q4532231
cites work: Vehicle routing with full loads
cites work: The pickup and delivery problem with time windows
cites work: Dynamic transport scheduling under multiple resource constraints
cites work: A heuristic to solve the synchronized log-truck scheduling problem
cites work: A hybrid method based on linear programming and tabu search for routing of logging trucks
cites work: Workforce routing and scheduling for electricity network maintenance with downtime minimization
cites work: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
cites work: New savings based algorithms for time constrained pickup and delivery of full truckloads.
cites work: Q3500143
cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
cites work: Vehicle Routing Problems with Inter-Tour Resource Constraints
cites work: Optimization by Simulated Annealing
cites work: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
cites work: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
cites work: Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
cites work: The dial-A-ride problem with transfers
cites work: A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
cites work: A near-exact method for solving the log-truck scheduling problem
cites work: A general heuristic for vehicle routing problems
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
cites work: Record breaking optimization results using the ruin and recreate principle
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
DOI: 10.1016/J.COR.2017.06.012
Recommended article: Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
Recommended article: Resources synchronization in a full truckload pickup and delivery problem: an exact approach
Recommended article: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
Recommended article: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
Recommended article: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Recommended article: Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
Recommended article: A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
Recommended article: Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
description: scientific article; zbMATH DE number 6902756