Keyword: vehicle routing & scheduling

Found 1030 papers in total
Analysis and integration of optimization models for logistic systems
1994,
The authors have developed some optimization models for the minimization of...
Using the tabu search method for the distribution of supplies in a hospital
1994,
Two supply delivery systems in a hospital are compared. In order to evaluate the...
A heuristic model for frequency planning and aircraft routing in small size airlines
1992,
The flight schedule of an airline is the primary factor in finding the most effective...
A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand
1992,
Research work dealing with the vehicle routing problem has not paid adequate attention...
Optimizing single-terminal dispatch of large volume trips to trucks
1994,
This paper considers the problem of delivering large volumes of products from a single...
Airline scheduling and routing in a hub-and-spoke system
1993,
This paper studies the competitive choice of flight schedules and route prices by...
Variable-depth search for the single-vehicle pickup and delivery problem with time windows
1993,
The authors consider a single depot and a set of customers with known demands, each of...
A routing model for pickups and deliveries: No capacity restrictions on secondary items
1993,
This paper examines a routing problem in which vehicles from a single depot cover a...
Locations models with routing considerations for a single obnoxious facility
1993,
The problem of optimally locating obnoxious facilities such as hazardous waste...
File size determination for waste oil collection in the province of Antwerp
1993,
A mathematical model is presented to determine the fleet size required to collect...
Polyhedral study of the capacitated vehicle routing problem
1993,
The capacitated vehicle routing problem (CVRP) considered in this paper occurs when...
Topological design of ring networks
1994,
In this paper the shortcomings of conventional ring networks are discussed and how...
Simultaneous scheduling of machines and automated guided vehicles
1993,
This paper is an attempt to make scheduling of AGVs an integral part of the overall...
Solving an urban routing problem using heuristics: A successful case study
1993,
Practical routing problems involving the distribution or collection of products,...
Expert system for AGV managing in bidirectional networks: KADS methodology based approach
1994,
This paper presents an expert system prototype for collision avoidance and routing...
Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming
1994,
The Traveling Salesman Problem with Precedence Constraints is to find an hamiltonian...
A probabilistic analysis of tour partitioning heuristics for the Capacitated Vehicle Routing Problem with unsplit demands
1993,
In the Capacitated Vehicle Routing Problem with unsplit demands, a customer’s...
A dynamic distribution model with warehouse and customer replenishment requirements
1993,
This paper addresses a multiperiod integrated model that plans deliveries to customers...
Implementing an insertion heuristic for vehicle routing on parallel hardware
1993,
In this paper, the authors report about the implementation of an insertion heuristic...
Alternate solution procedures for the location-routing problem
1993,
The location-routing problem occurs in the context of physical distribution system...
Designing collection routes through bank branches
1993,
Most banks must send out vehicles on a regular basis to their branches in order to...
Administrative transportation
1993,
This article is concerned with the study of administrative transportation for a large...
A trucks dispatching system for the transportation of forestry products
1990,
This paper presents an administrative and computational system developed for forestry...
The hub network design problem with stopovers and feeders: The case of Federal Express
1993,
This paper introduces a network planning problem called the hub network design problem...
Papers per page: