A local search heuristic for the pre- and end-haulage of intermodal container terminals
type: Item
instance of: scholarly article
title: A local search heuristic for the pre- and end-haulage of intermodal container terminals
zbMATH Open document ID: 1160.90313
published in: Computers \& Operations Research
publication date: 2009-05-19T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5554738
zbMATH Keywords: intermodal transport
zbMATH Keywords: pickup and delivery problem
zbMATH Keywords: full truckload
zbMATH Keywords: time windows
zbMATH Keywords: heuristics
author: An Caris
author: Gerrit K. Janssens
MaRDI profile type: Publication
full work available at URL: j.cor.2008.12.007
OpenAlex ID: W2010237370
cites work: Opportunities for OR in intermodal freight transport research: A review.
cites work: The General Pickup and Delivery Problem
cites work: A classification scheme for vehicle routing and scheduling problems
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: The pickup and delivery problem with time windows
cites work: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: New savings based algorithms for time constrained pickup and delivery of full truckloads.
cites work: Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
cites work: A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
cites work: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
cites work: Q3523238
cites work: Formulations and exact algorithms for the vehicle routing problem with time windows
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
cites work: A guide to vehicle routing heuristics
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
DOI: 10.1016/J.COR.2008.12.007
Recommended article: Q3839026
Recommended article: Efficient model and heuristic for the intermodal terminal location problem
Recommended article: Q3494397
Recommended article: A feasibility-based heuristic for the container pre-marshalling problem
Recommended article: A tabu search heuristic for the inland container transportation problem
Recommended article: Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
Recommended article: Efficient metaheuristics to solve the intermodal terminal location problem
Recommended article: Novel models and algorithms for location assignment for outbound containers in container terminals
description: scientific article; zbMATH DE number 5554738