In many European countries, municipalities offer their inhabitants a wide variety of social services. In this paper we will focus on efficiently scheduling home care, transportation of the elderly, and home meal delivery. These so-called municipal or communal routing problems can be modelled as different variants of the vehicle routing problem, a well-known optimization problem from the literat...

In this study, a genetic algorithm is applied to obtain the best combination of transportation parameters for vehicle dispatching. The searching mechanism based on genetic algorithm can find several feasible solutions of dispatching parameters to proceed with transportation plan within constrained conditions. Besides, the concept of fuzzy due time is applied to replace that of time window so as...

Although the m-ATSP (or multi traveling salesman problem) is well known for its importance in scheduling and vehicle routing, it has, to the best of our knowledge, never been studied polyhedraly, i.e., it has always been transformed to the standard ATSP. This transformation is valid only if the cost of an arc from node i to node j is the same for all machines. In many practical applications thi...

There has been considerable recent interest in the dynamic vehicle routing problem, but the complexities of this problem class have generally restricted research to myopic models. In this paper, we address the simpler dynamic assignment problem, where a resource (container, vehicle or driver) can only serve one task at a time. We propose a very general class of dynamic assignment models, and pr...

In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed include single-machine and multiple-machine scheduling problems, the travelling salesman problem, vehicle routing problems, and many others. The distance measures are based on the edit distance. We introduce several exte...

Recent technological advances in communication systems now allow the exploitation of realtime information for dynamic vehicle routing and scheduling. It is possible, in particular, to consider diverting a vehicle away from its current destination in response to a new customer request. In this paper, a strategy for assigning customer requests, which includes diversion, is proposed, and various i...

The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This paper proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution method...

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...