In order to improve the efficiency of vehicle objective, the paper addresses the problem of multi-depot vehicle routing with time window. An adaptive genetic algorithm based on the artificial bee colony algorithm is developed for the solution process of the multi-depot vehicle routing problem. The new algorithm provides not only with the strong global search capability, but also the strong loca...

This paper analyses the planning problem of including breaks and rest periods in vehicle routes and schedules from a conceptual point of view. The relevant legal restrictions for drivers’ driving and working hours are presented and their impact on vehicle routing is shown. Consequently the overall planning problem is decomposed into three subproblems: clustering of customer requests, scheduling...

The school bus routing and scheduling problem deals with the transportation of pupils from home to school in the morning and from school to home in the evening. It is a problem in public transportation and differs from typical vehicle routing problems in several aspects, as for example pointed out in [6]. Variants of this problem are often studied in literature. A comprehensive overview of exis...

The problem of multi-vehicle path planning can be treated as a machine scheduling or a vehicle routing problem with definite temporal, spatial and other constraints. We consider the scenario of path planning of multiple Automated Guided Vehicles (AGVs) and Automated Trucks (ATs) in a Ship-Container Terminal area*. Our main focus is on developing global and local path planning methods for each o...

The vehicle scheduling problem (VSP) is a problem of interest to many researchers and practitioners. The general VSP is concerned with minimizing the total distance associated with a fixed set of vehicle routes by determining which vehicles will satisfy the demands at various customer locations. The design of most general distribution systems usually involves the assignment of permanent custome...

A new transit operating strategy is presented in which service vehicles operate in pairs with the lead vehicle providing an all-stop local service and the following vehicle being allowed to skip some stops as an express service. The underlying scheduling problem is formulated as a nonlinear integer programming problem with the objective of minimizing the total costs for both operators and passe...

In this paper, we propose a general agent-based distributed framework where each agent is implementing a different metaheuristic/local search combination. Moreover, an agent continuously adapts itself during the search process using a direct cooperation protocol based on reinforcement learning and pattern matching. Good patterns that make up improving solutions are identified and shared by the ...

During the end-of-life (EOL) product recovery process, there are a series of combinatorial optimization problems (COPs) that should be efficiently solved. These COPs generally result from reverse logistics (RL) and remanufacturing, such as facility location vehicle routing in RL, scheduling, planning, line balancing remanufacturing. Each RL remanufacturing has been reviewed; however, no review ...