نتایج جستجو برای: simultaneous pickup and delivery
تعداد نتایج: 16867360 فیلتر نتایج به سال:
This paper presents a review of vehicle routing problem with simultaneous pickup and deliveries (VRPSPD). VRPSPD is a variant of the VRP where both delivery and pickup demands are fulfilled simultaneously. Due to computer accessibility and increased capability in computing, algorithm development has shown major advancements. These were reflected in VRP researches also. The need to improve vehic...
The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a pickup point and a delivery point. This paper addresses a variant of the PDP where the requests are transportation demands arising from disabled persons. Vehicle passengers can change of vehicle during their trip on specific locations called “transfer points”. Solving this v...
in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...
In this paper, we propose a new method for reducing assembly time in printed circuit board (PCB) assembly by prioritizing efficient simultaneous pickup operation of placement machines. There are three major problems of the scheduling: (1) component feeder location (affects efficiency of pickup operation), (2) mounting sequencing (affects total distance of the mounting tour) , and (3) simultaneo...
One of the most common combinatorial problems in logistics and transportation applications is the Stacker Crane problem (SCP), where commodities or customers are associated with a pickup location and a delivery location, and the objective is to find a minimum-length tour visiting all locations with the constraint that each pickup location and its associated delivery location are visited in cons...
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real time. It discusses some general issues as well as solution strategies.
Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. A widely-encountered type of PDP is the Stacker Crane Problem (SCP), where each commodity/customer is associated with a pickup location and a delivery location, and the objective is to find a minimum-length ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید