Showing 1 - 10 of 170
Persistent link: https://www.econbiz.de/10011514162
In this paper we revise and modify an old branch-and-bound method for solving the asymmetric distance–constrained vehicle routing problem suggested by Laporte et al. in 1987. Our modification is based on reformulating distance–constrained vehicle routing problem into a travelling salesman...
Persistent link: https://www.econbiz.de/10011052779
This paper aims to develop a mixed load algorithm for the school bus routing problem (SBRP) and measure its effects on the number of required vehicles. SBRP seeks to find optimal routes for a fleet of vehicles, where each vehicle transports students from their homes and to their schools while...
Persistent link: https://www.econbiz.de/10010577613
This paper discusses the use of probabilistic or randomized algorithms for solving vehicle routing problems with non-smooth objective functions. Our approach employs non-uniform probability distributions to add a biased random behavior to the well-known savings heuristic. By doing so, a large...
Persistent link: https://www.econbiz.de/10010995375
In this paper, a proportion-based robust optimization approach is developed to deal with uncertain combinatorial optimization problems. This approach assumes that a certain proportion of uncertain coefficients in each solution are allowed to change and optimizes a deterministic model so as to...
Persistent link: https://www.econbiz.de/10010603396
Persistent link: https://www.econbiz.de/10013040814
Persistent link: https://www.econbiz.de/10013534526
Persistent link: https://www.econbiz.de/10013534529
Persistent link: https://www.econbiz.de/10013534536