نتایج جستجو برای: school bus routing problem
تعداد نتایج: 1183421 فیلتر نتایج به سال:
The bus evacuation problem (BEP) is a vehicle routing problem that arises in emergency planning. It models the evacuation of a region from a set of collection points to a set of capacitated shelters with the help of buses, minimizing the time needed to bring the last person out of the endangered region. In this work, we describe multiple approaches for finding both lower and upper bounds for th...
one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...
OBJECTIVE There is no safer way to transport a child than a school bus. Fatal crashes involving occupants are extremely rare events in the US. In recent years, school bus transportation began to develop in China. We want to bring advanced experience on school bus safety in Western countries such as the US to developing countries. METHODS We searched the papers related to school bus safety fro...
using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...
in this study the location routing problem with fuzzy parameters is taken into account, this problem involves determining the location of the depots and routing of the vehicles in order to serve the customers. in this study a location routing problem with fuzzy travel times and due dates is considered and two objective models are proposed. the considered objectives are minimizing the total cost...
The bus line planning problem or transit network design with integrated passenger routing is a challenging combinatorial problem. Although well-known benchmark instances for this have been available decades, the state of art lacks optimal solutions these instances. branch and bound algorithm, presented in paper, introduces three novel concepts to determine solutions: (1) new pool generation met...
Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n log n log log n) time, improving ove...
The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as operators to address the vehicle routing problem with time windows (VRPTW). We show that it allows to extend the self-organizing map to deal with a version of the vehicle routing problem with time windows where the number of vehicles is an input, and by adding some walking distance from customers t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید