Integrated planning of loaded and empty container movements
type: Item
instance of: scholarly article
title: Integrated planning of loaded and empty container movements
zbMATH Open document ID: 1263.90040
author: Kris Braekers
author: An Caris
author: Gerrit K. Janssens
published in: OR Spectrum
publication date: 2013-03-28T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/14633
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6149115
zbMATH Keywords: vehicle routing
zbMATH Keywords: empty containers
zbMATH Keywords: drayage
zbMATH Keywords: deterministic annealing
MaRDI profile type: Publication
OpenAlex ID: W2046777149
cites work: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: A threshold accepting metaheuristic for the vehicle routing problem with time windows.
cites work: A local search heuristic for the pre- and end-haulage of intermodal container terminals
cites work: Dynamic and Stochastic Models for the Allocation of Empty Containers
cites work: A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
cites work: Multi-depot vehicle scheduling problems with time windows and waiting costs
cites work: Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Improved modeling and solution methods for the multi-resource routing problem
cites work: New savings based algorithms for time constrained pickup and delivery of full truckloads.
cites work: Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
cites work: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
cites work: An optimization approach for planning daily drayage operations
cites work: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
cites work: Fleet sizing and vehicle routing for container transportation in a static environment
cites work: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
cites work: Look-ahead strategies for dynamic pickup and delivery problems
cites work: Q4889095
cites work: The multiple TSP with time windows: vehicle bounds based on precedence graphs
cites work: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
cites work: A solution approach for log truck scheduling based on composite pricing and branch and bound
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
cites work: Heuristic-based truck scheduling for inland container transportation
DOI: 10.1007/S00291-012-0284-5
description: scientific article; zbMATH DE number 6149115