نتایج جستجو برای: routing problem
تعداد نتایج: 918597 فیلتر نتایج به سال:
This paper introduces the Cyclic Production Routing Problem (CPRP). The CPRP is an extension of well-known NP-hard (PRP), which a hard-to-solve combinatorial optimisation problem with numerous practical applications in field freight transportation, logistics and supply chain management. Under PRP setting, manufacturer responsible for determining production decisions, as well timing quantity rep...
In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented i...
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
Risk factors are generally defined and assigned to road networks, as constant measures in hazmat routing problems. In fact, they may be dynamic variables depending on traffic volume, weather and road condition, and drivers' behavior. In this research work, risk factors are defined as dynamic variables using the concept of chaos theory. The largest Lyapunov exponent is utilized to determine the ...
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید