This work presents the Vehicle Routing with Time Windows and Loading Problem (VRTWLP) as a multi-objective optimization problem, implemented within a Genetic Algorithm. Specifically, the three dimensions of the problem to be optimized – the number of vehicles, the total travel distance and volume utilization – are considered to be separated dimensions of a multiobjective space. The quality of t...

We study a waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and driver’s lunch breaks. Recently Kim et al. [1] introduced and addressed this problem using an extension of the well-known Solomon’s insertion approach, and a clustering-based algorithm. We propose and present the results of an initial study of a multi-objective genetic algori...

The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective is to find the lowest distance set of routes to deliver goods, using a fleet of identical vehicles with restricted capacity, to customers with service time windows. However, there are other objectives, and having a ra...

Inspired by long-distance road transport in industrial logistics China, this paper studies a simultaneous loading scheduling and vehicle routing problem over multi-workday planning horizon. Industrial cargo often requires specialized facilities, these facilities vary performance quantity are subject to available time constraints. Consequently, achieving coordinated optimization of becomes signi...

Combinatorial problems appear in many real life circumstances, for example, when we drive from one location to another, we usually look for the shortest route, when schools have to allocate students and teachers to classrooms, they do this assignment trying not to crowd the room and not to interfere with the teacher’s schedule, and when the postman has to ride his bike to do the deliveries, he ...

The Vehicle Routing Problem with Time Windows (VRPTW) is a complex combinatorial optimisation problem which can be seen as a combination of two well-known sub-problems: the Travelling Salesman Problem and the Bin Packing Problem. Relevant objectives include minimising the number of vehicles and the total travelling distance for delivering demand to customers, while complying with capacity and t...

The vehicle routing problem as a challenging decision has been studied extensively. More specifically, solving it for mixed fleet requires realistic calculation of the performance electric and combustion vehicles. This study addresses new variant vehicles under presence time windows charging stations. A bi-objective mixed-integer programming model is developed which aims at minimizing cost poll...