نتایج جستجو برای: ambulance routing problem

تعداد نتایج: 922645  

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 ...

Mina Vajed Khiavi Sajjad Jahanbakhsh Gudakahriz, SHahram Jamali

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...

The survival rate of medical emergencies depends highly on the intervention time and prompt medical care on the scene. The idea of “bring the doctor and medical equipment to the spot” was born in Hungary in the mid-1950s. The demand for advanced life support was a consequence of the fast growth of industry and traffic. It is worthwhile to review the development of the idea, the therapeutic meth...

H. Larki M. Sayyah M. Yousefikhoshbakht,

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...

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...

Journal: :مهندسی صنایع 0
علی¬رضا محمدی شاد دانش آموخته کارشناسی ارشد مهندسی صنایع- دانشگاه بوعلی سینا پرویز فتاحی دانشیار و مدیر گروه مهندسی صنایع- دانشگاه بوعلی سینا

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

Journal: :مدیریت زنجیره تأمین 0
عرفان بابایی تیرکلایی سعید سائیل پور سیدحمید میرمحمدی

this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید