The split delivery vehicle scheduling problem with time windows and grid network distances

DOI10.1016/0305-0548(94)00040-FzbMath0827.90072MaRDI QIDQ1892675

J. W. Giffin, P. W. Frizzell

Publication date: 19 June 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicstime windowsplit delivery vehicle routinggrid network distancesnonlinear delivery time functions

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times ⋮ A tabu search heuristic for the vehicle routing problem with time windows and split deliveries ⋮ An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex ⋮ Testing local search move operators on the vehicle routing problem with split deliveries and time windows ⋮ A branch-price-and-cut method for a ship routing and scheduling problem with split loads ⋮ The vehicle routing problem with demand range ⋮ A heuristic approach to a single stage assembly problem with transportation allocation ⋮ Integer linear programming models for a cement delivery problem ⋮ Green split multiple-commodity pickup and delivery vehicle routing problem ⋮ The Maritime Pickup and Delivery Problem with Time Windows and Split Loads ⋮ An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty ⋮ The Split Delivery Vehicle Routing Problem: A Survey ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ Vehicle routing problems with split deliveries ⋮ An adaptive memory algorithm for the split delivery vehicle routing problem ⋮ A large neighbourhood search heuristic for ship routing and scheduling with split loads ⋮ An empirical study on the benefit of split loads with the pickup and delivery problem ⋮ Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil ⋮ On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• A classification scheme for vehicle routing and scheduling problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Split delivery routing
• Bounds and Heuristics for Capacitated Routing Problems
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Savings by Split Delivery Routing
• Capacitated Vehicle Routing on Trees
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The split delivery vehicle scheduling problem with time windows and grid network distances