To reduce delivery failures in last mile delivery, several types of options have been proposed the past twenty years. Still, customer satisfaction is a challenge because single location chosen independently time at which customer’s order will be delivered. In addition, shared locations such as lockers and shops also experience failure due to capacity or opening-time issues moment delivery. addr...

In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented i...

The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results...

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

−− A key issue in logistics is the efficient management of a vehicle fleet servicing a set of customers with known demands. Every vehicle route must start and finish at the assigned depot, each customer is to be visited by a single vehicle and vehicle capacities must not be exceeded. These are the constraints for the capacitated vehicle routing problem (VRP) whose objective is usually the minim...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...