The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) to solve the ALL-SPP based on column-row navigation through the adjacency matrix. DM-ALL-SPP is...

We consider a car-sharing problem in a company during business hours. The employees, located at one or several offices, have to travel to one or more appointments each with a fixed location and fixed start and end times and return to one of the offices afterwards. Each employee trip can be...

In some traffic management situations, a cordon (a set of points at which traffic flows into a given area) is set in a road network to establish a reference for the location of equipment to implement traffic measurements and controls (e.g., traffic volume surveys and congestion charging)....

The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real...

The last mile delivery is particularly challenging for stochastic deliveries with narrow time windows. This topic is timely due to the rise of e-commerce and courier type services and the impacts of fleet size and vehicle type on delivery costs. A novel contribution of this research is to...