Увійти

Готові списки джерел за темами / Simultaneously Pickup and Delivery / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Simultaneously Pickup and Delivery.

Статті в журналах з теми "Simultaneously Pickup and Delivery"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Simultaneously Pickup and Delivery".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

He, Pengfei, and Jing Li. "Vehicle routing problem with partly simultaneous pickup and delivery for the cluster of small and medium enterprises." Archives of Transport 45, no. 1 (2018): 35–42. http://dx.doi.org/10.5604/01.3001.0012.0940.

Повний текст джерела

Анотація:

The transportation service for the cluster of small and medium enterprises (SMEs) is different with traditional vehicle routing problems. In the cluster of SMEs, parts of enterprises are pickup and delivery spots simultaneously. But some enterprises are partly pickup and delivery simultaneously. Traditional mathematics models and algorithms are not suitable to solve the vehicle routing problem partly simultaneous pickup and delivery (VRPPSD). In this paper, a mathematics operational model is proposed to analyze the transportation service of the cluster companies. A hybrid algorithm which is co

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Yu, Vincent F., Hadi Susanto, Yu-Hsuan Yeh, Shih-Wei Lin, and Yu-Tsung Huang. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers." Mathematics 10, no. 6 (2022): 920. http://dx.doi.org/10.3390/math10060920.

Повний текст джерела

Анотація:

Customers’ expectations of timely and accurate delivery and pickup of online purchases pose a new challenge to last-mile delivery. When the goods sent to customers are not received, they must be returned to the warehouse. This situation provides a high additional cost. Parcel locker systems and convenience stores have been launched to solve this problem and serve as pickup and payment stations. This research investigates a new last-mile distribution problem in the augmented system with three service modes: home delivery and pickup, parcel locker delivery and pickup, and home or parcel locker d

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Liu, Yuxin, Zihang Qin, and Jin Liu. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup." Mathematics 11, no. 15 (2023): 3328. http://dx.doi.org/10.3390/math11153328.

Повний текст джерела

Анотація:

The Split Vehicle Routing Problem with Simultaneous Delivery and Pickup (SVRPSDP) consists of two subproblems, i.e., the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) and the Split Delivery Vehicle Routing Problem (SDVRP). Compared to the subproblems, SVRPSDP is much closer to reality. However, some realistic factors are still ignored in SVRPSDP. For example, the shipments are integrated and cannot be infinitely subdivided. Hence, this paper investigates the Granularity-based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup (GSVRPSDP). The characteri

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Sciomachen, Anna, and Maria Truvolo. "An Exact Approach for Selecting Pickup-Delivery Stations in Urban Areas to Reduce Distribution Emission Costs." Mathematics 11, no. 8 (2023): 1876. http://dx.doi.org/10.3390/math11081876.

Повний текст джерела

Анотація:

This paper deals with a variant of the multifacility location-routing problem in urban areas. The distribution network is modelled by an undirected graph, in which the nodes are split into a set of pickup-delivery stations, a depot, and a set of customers. The arcs represent the minimum-cost connections between nodes. A customer is assigned to a pickup-delivery station if he or she can reach it at the lowest sustainable cost, i.e., on foot or by bicycle, without exceeding a predefined maximum distance. The goal is to minimise the goods’ total delivery cost, including pollutant emissions. In th

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Guo, Qinge, and Nengmin Wang. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery Considering the Total Number of Collected Goods." Mathematics 11, no. 2 (2023): 311. http://dx.doi.org/10.3390/math11020311.

Повний текст джерела

Анотація:

As a consequence of e-commerce development, large quantities of returned goods are shipped every day. The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) has become one of the most important areas of logistics management. Most related studies are aimed at minimizing travel time. However, the total number of collected goods is also very important to logistics companies. Thus, only considering the traveling time cannot reflect actual practice. To effectively optimize these operations for logistics companies, this paper introduces the vehicle routing problem with simultaneo

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Wang, Biao. "Optimization of Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery." Journal of Electronic Research and Application 9, no. 3 (2025): 350–58. https://doi.org/10.26689/jera.v9i3.10815.

Повний текст джерела

Анотація:

This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery (MVRPTWSPD), aiming to optimize logistics distribution routes and minimize total costs. A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center, focusing on minimizing vehicle dispatch, loading and unloading, operating, and time window penalty costs. The model incorporates constraints such as vehicle capacity, time windows, and travel distance, and is solved using a genetic algorithm to ensure optimal route planning. Through MA

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Suwatcharachaitiwong, Sirirat, Chun-Cheng Lin, Weidong Huang, and Lun-Ping Hung. "On the medication distribution system for home health care through convenience stores, lockers, and home delivery." Health Informatics Journal 26, no. 4 (2020): 3163–83. http://dx.doi.org/10.1177/1460458220936395.

Повний текст джерела

Анотація:

Medication distribution service can be delivered based on a combination of home delivery and customer pickup. That is, medications are delivered either to customers’ homes directly or to the pickup facilities (e.g. lockers) close to customers’ homes. In Taiwan, there are more than 11,000 convenience stores that provide a 24-h service for customers to pick up the ordered items from e-commerce, which is unique to the world. In the medication distribution system, convenience stores can provide a unique opportunity for customers to more conveniently collect medications at stores, and also can redu

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Chentli, Hayet, Rachid Ouafi, and Wahiba Ramdane Cherif-Khettaf. "A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services." RAIRO - Operations Research 52, no. 4-5 (2018): 1295–328. http://dx.doi.org/10.1051/ro/2018024.

Повний текст джерела

Анотація:

The Vehicle Routing Problem with Simultaneous Pickups and Deliveries (VRPSPD) is a variant of the Vehicle Routing Problem. In this variant, an unlimited fleet of capacitated vehicles is used to satisfy both pickup and delivery demands of each customer simultaneously. In many practical situations, such a fleet is costly. The present study extends the VRPSPD by assuming a fixed number of vehicles when the constraint of visiting all customers is relaxed. More specifically, profits are assigned to the customers with the goal of maximizing the difference between collected profits and routing costs.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Naomi, Anatasia, Asri Bekti Pratiwi, and Herry Suprajitno. "Grasshopper Optimizaton Algorithm (GOA) untuk Menyelesaikan Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD)." Tensor: Pure and Applied Mathematics Journal 3, no. 2 (2022): 73–84. http://dx.doi.org/10.30598/tensorvol3iss2pp73-84.

Повний текст джерела

Анотація:

The purpose of this paper is to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) using the Grasshopper Optimization Algorithm (GOA). Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is a problem of forming routes that serve each customer, by delivering and retrieving simultaneously. The purpose of VRPSPD is to minimize the total mileage to serve all customers with the limit that each customer is served exactly once, and the vehicle load does not exceed its maximum capacity. Grasshopper Optimization Algorithm (GOA) is an algorithm inspired b

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Amir, Masoud Rahimi, Rajabi Vahid, and Ramezani Khansari Ehsan. "Developing Genetic Algorithm to Solve Vehicle Routing Problem with Simultaneous Pickup and Delivery." Journal of Civil Engineering and Materials Application 4, no. 2 (2020): 103–14. https://doi.org/10.22034/jcema.2020.224281.1019.

Повний текст джерела

Анотація:

One of the well-known and highly used extensions of vehicle routing problem (VRP) is Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), in which delivery and pickup for each customer is carried out simultaneously. In this study, it is attempted to present an optimal method for solving VRPSPD using genetic algorithm. In this method, genetic algorithm is improved by modifying genetic parameters and presenting efficient and proper operators. Three Randomized, Nearest neighbor and Cheapest Insertion algorithms are utilized to create the initial population. Given the different

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Sze, San Nah, Siaw Ying Doreen Sek, Jeeu Fong Sze, Wai Shiang Cheah, and Kang Leng Chiew. "Vehicle Routing Problem with Simultaneous Pickup and Delivery." International Journal on Advanced Science, Engineering and Information Technology 10, no. 4 (2020): 1360. http://dx.doi.org/10.18517/ijaseit.10.4.10234.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Yilmaz, Yusuf, and Can B. Kalayci. "Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery." Mathematics 10, no. 17 (2022): 3108. http://dx.doi.org/10.3390/math10173108.

Повний текст джерела

Анотація:

This paper addresses the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery (EVRP-SPD), in which electric vehicles (EVs) simultaneously deliver goods to and pick up goods from customers. Due to the limited battery capacity of EVs, their range is shorter than that of internal combustion vehicles. In the EVRP, in addition to the depot and the customers, there are also charging stations (CS) because EVs need to be charged when their battery is empty. The problem is formulated as an integer linear model, and an efficient solution is proposed to minimize the total distance trave

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Rizkiani, Firda Nur, Rosmala Sari, and Arif Imran. "A Simulated Annealing for Heterogenous Fleet Vehicle Routing Problem with Multiple Trips and Pickup-Delivery." Jurnal Rekayasa Hijau 7, no. 3 (2023): 277–88. https://doi.org/10.26760/jrh.v7i3.277-288.

Повний текст джерела

Анотація:

ABSTRAKSalah satu masalah paling krusial dalam Supply Chain Management (SCM) adalah perancangan jaringan distribusi yang secara signifikan memengaruhi biaya total. Salah satu masalah umum dalam distribusi adalah bagaimana merancang rute kendaraan yang optimal. Masalah ini dikenal sebagai Vehicle Routing Problem (VRP). Sebuah variasi VRP yang dikenal sebagai Heterogeneous Fleet Vehicle Routing Problem with Multiple Trips and Pickup and Delivery (HFVRPMTPD) memiliki karakteristik berikut: jenis kendaraan yang berbeda, perjalanan ganda, dan pengambilan serta pengantaran secara simultan. Penelitia

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Nur Rizkiani, Firda, Ilham Geraudy, and Arif Imran. "Solving the Vehicle Routing Problem with Multiple Trips and Simultaneous Delivery-Pickup for Drinking Water Distribution Company." E3S Web of Conferences 484 (2024): 01003. http://dx.doi.org/10.1051/e3sconf/202448401003.

Повний текст джерела

Анотація:

Transportation is a crucial factor in distribution, as it can save up to 50% of the overall costs. The Vehicle Routing Problem with Multiple Trips and Simultaneous Delivery-Pickup (VRPMTSDP) has become one of the most important areas of logistic management. This problem is an extension of the Vehicle Routing Problem (VRP), including the following characteristics: multiple trips and simultaneous delivery-pickup. A set of homogenous vehicles is available at the depot to deliver and pick up customer’s goods. The route of each vehicle in serving customers can cover more than one trip. This researc

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Berghida, Meryem, and Abdelmadjid Boukra. "Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery." International Journal of Applied Metaheuristic Computing 6, no. 3 (2015): 53–68. http://dx.doi.org/10.4018/ijamc.2015070103.

Повний текст джерела

Анотація:

This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a co

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Ali, Örnek, and Esnaf Şakir. "Revenue Management Focused Capacitated Vehicle Routing Model in Supply Chain Management." Indian Journal of Science and Technology 13, no. 8 (2020): 941–53. https://doi.org/10.17485/ijst/2020/v13i08/149943.

Повний текст джерела

Анотація:

Abstract <strong>Objectives:</strong> To propose revenue management focused model for Capacitated Vehicle Routing Problem with Simultaneous Pickup and Delivery and pursue a solution to it. In some industries, customer demand for delivery and pickup fluctuates and the vehicle capacities are limited. Existing research focuses on either Revenue Maximization or Transportation Cost Minimization. To be able to run such businesses profitably, it is necessary to consider both objectives by the help of the proposed model. Dynamic pricing will be used for revenue maximization, by booking early rese

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Quintana, Lisandra, Yalexa Herrera-Mena, José-Luis Martínez-Flores, Marcos Coronado, Gisela Montero, and Patricia Cano-Olivos. "DESIGN OF WASTE VEGETABLE OIL COLLECTION NETWORKS APPLYING VEHICLE ROUTING PROBLEM AND SIMULTANEOUS PICKUP AND DELIVERY." Acta logistica 7, no. 4 (2020): 261–68. http://dx.doi.org/10.22306/al.v7i4.188.

Повний текст джерела

Анотація:

The growth of industrialization in Mexico has caused an increase in the demand for materials to satisfy the consumption of goods and services of a growing population. Given this scenario, there is a rise of the residual generation with affectations on the ecosystem and population health. Hence, the objective of this research was to design a network for waste vegetable oil collection based on vehicle routing problem with simultaneous pickup and delivery, starting from a distribution centre to 49 restaurants, as the generation sources of waste vegetable oil. The Vehicle Routing Problem Simultane

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Stefhen, Gilbert, Dedy Suryadi, and Titi Iswari. "Development Of A Vehicle Routing Problem Model To Reduce Service Delays In Pickup And Delivery Operations." Journal of Social Research 4, no. 7 (2025): 1855–62. https://doi.org/10.55324/josr.v4i7.2683.

Повний текст джерела

Анотація:

The rapid growth of the e-commerce sector in Indonesia has increased the demand for reliable and timely logistics services. However, challenges such as delayed pickups and deliveries continue to occur, leading to the accumulation of operational penalties. This study aims to develop a mathematical model based on the Vehicle Routing Problem (VRP) that addresses the complexities of modern logistics distribution. The proposed model, named HFMTVRPDPTW (Heterogeneous Fleet Multi-Trip Vehicle Routing Problem with Delivery and Pickup and Time Windows), incorporates five key elements: vehicle capacity,

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Vidovic, M. "Two mathematical formulations for the containers drayage problem with time windows." International Journal of Business Science and Applied Management 7, no. 3 (2012): 23–32. http://dx.doi.org/10.69864/ijbsam.7-3.92.

Повний текст джерела

Анотація:

The containers drayage problem studied here arise in ISO container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but mostly 20ft, and 40ft empty and/or loaded should be delivered to, or collected from the customers. Therefore, the problem studied here is closely related to the vehicle routing problem with the time windows that finds an optimal set of or routes visiting deliveries and pickups customers. The specificity of the container drayage problem analyzed here lies in the fact that a truck may

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Syed Muhammad Daniyal, Mohsin Mubeen Abbasi, Dilbar Hussain, Usama Amjad, Abdul Basit Abro, and Mehwish Naeem. "A Hybrid Approach for Simultaneous Effective Automobile Navigation with DE and PSO." VAWKUM Transactions on Computer Sciences 12, no. 2 (2024): 01–15. https://doi.org/10.21015/vtcs.v12i2.1914.

Повний текст джерела

Анотація:

Automobile Navigation is fundamentally an optimization challenge focused on transportation logistics between a depot and various clients. In this paper, we specifically address the complex variant of Automobile Navigation that involves simultaneous pickup and delivery tasks, which must be executed concurrently at clients' locations. This dual requirement introduces significant complexity, as traditional exact approaches struggle to rapidly identify near-optimal solutions due to the problem's NP-hardness. Therefore, the objective of this research is to develop a novel hybrid algorithm that inte

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Wang, Xiaowei. "Research on Hybrid Immune Algorithm for Solving the Location-Routing Problem With Simultaneous Pickup and Delivery." Journal of Cases on Information Technology 24, no. 5 (2022): 1–17. http://dx.doi.org/10.4018/jcit.295253.

Повний текст джерела

Анотація:

In the simultaneous pickup and delivery problem, every customer has both delivery demand and pick-up demand, and both demands need to be served simultaneously．Under this condition, a location-routing problem with simultaneous pickup and delivery model was established to minimize the sum of location cost, routing cost and transportation cost. For solving this model, a Hybrid Immune Algorithm was developed. The initial solution was generated by greedy clustering algorithm; The antibody was evaluated and sorted by the original immune algorithm; And the immune operation of the original algorithm w

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Tunnisaki, Fadlah, and Sutarman. "Clarke and Wright Savings Algorithm as Solutions Vehicle Routing Problem with Simultaneous Pickup Delivery (VRPSPD)." Journal of Physics: Conference Series 2421, no. 1 (2023): 012045. http://dx.doi.org/10.1088/1742-6596/2421/1/012045.

Повний текст джерела

Анотація:

Abstract This study aims to establish the mathematical model Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) on 3 kg of LPG gas distribution and its solution using the method of Clarke and Wright Savings. Data used include a list of areas of consumers, service delivery company, the amount of consumer demand, vehicle type and vehicle capacity. The data is then processed to be modeled as hereinafter Vehicle Routing Problem with Simultaneous Pickup Delivery (VRPSPD) problems solved by the method of Clarke and Wright Savings[1]. Based on the calculation, the result for the t

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Wolfenburg, Andrzej. "NEW VERSION OF THE BBS METHOD AND ITS USAGE FOR DETERMINING AND SCHEDULING VEHICLE ROUTES." Archives of Transport 31, no. 3 (2014): 83–91. http://dx.doi.org/10.5604/08669546.1146991.

Повний текст джерела

Анотація:

The work presents a method of the vehicle routing and scheduling using the modified Branch and Bound Simulation method for vehicles simultaneously carrying loads from multiple orders. Limitations concerning vehicle loads and time windows in pickup and delivery points are taken into consideration. The developed algorithm appoints the shortest, the fastest and the cheapest routes with a certain known accuracy. A modification of the BBS method is described A sample of result using Google API is shown.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Koç, Çağrı, Gilbert Laporte, and İlknur Tükenmez. "A review of vehicle routing with simultaneous pickup and delivery." Computers & Operations Research 122 (October 2020): 104987. http://dx.doi.org/10.1016/j.cor.2020.104987.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Rashidi Komijan, Alireza, and Danial Delavari. "Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study." International Journal of Production Management and Engineering 5, no. 2 (2017): 45. http://dx.doi.org/10.4995/ijpme.2017.5960.

Повний текст джерела

Анотація:

<div data-canvas-width="542.172"><p>The well-known Vehicle Routing Problem (VRP) is to find proper sequence of routes in order to minimize transportation costs. In this paper, a mixed-integer programming model is presented for a food distributer company and the model outputs are to determine the optimal routes and amount of pickup and delivery. In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. The proposed model with respect to real conditions is multi-period and has two different time periods: one for dispatchin

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Pourmohammadreza, Nima, and Mohammad Reza Akbari Jokar. "A Novel Two-Phase Approach for Optimization of the Last-Mile Delivery Problem with Service Options." Sustainability 15, no. 10 (2023): 8098. http://dx.doi.org/10.3390/su15108098.

Повний текст джерела

Анотація:

As the growth of e-commerce continues to accelerate, there is a need for new and innovative strategies in last-mile delivery to meet the changing demands of customers. The main objective of this study is to address this need by optimizing the last-mile delivery problem with service options (LMDPSOs) through a novel two-phase approach that considers various delivery options such as home delivery, self-pickup, and delivery at different prices. This original approach enables simultaneous optimization of the selection of the most appropriate pickup and delivery points and determination of the most

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Liu, Yan-Qiu, Jing Han, Ying Zhang, Yan Li, and Tao Jiang. "Multivisit Drone-Vehicle Routing Problem with Simultaneous Pickup and Delivery considering No-Fly Zones." Discrete Dynamics in Nature and Society 2023 (August 22, 2023): 1–21. http://dx.doi.org/10.1155/2023/1183764.

Повний текст джерела

Анотація:

The employment of drones for the distribution of goods represents a significant avenue for addressing logistical challenges at the end of the supply chain. The truck-drone cooperative delivery model overcomes drone limitations such as limited capacity and endurance and has emerged as a crucial mode of drone participation in logistics delivery. This delivery model effectively reduces delivery costs and shortens delivery times. Herein, we examine a variant of the truck-drone routing problem, which encompasses the strategic deployment and routing of multiple fleets of trucks, each equipped with a

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Zhang, Yinggui, and Lining Sheng. "Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints." Sustainability 15, no. 11 (2023): 9132. http://dx.doi.org/10.3390/su15119132.

Повний текст джерела

Анотація:

In order to promote the cost reduction and efficiency improvement of the logistics distribution process and to guarantee the safety of goods transportation, this paper studies the portfolio optimization of goods loading and the problem of simultaneous pickup and delivery vehicle routing. A balanced loading constraint was introduced to restrict loading through two aspects of axle weight bearing and lateral center-of-gravity offset. With the shortest total route length as the objective, this paper constructs a simultaneous pickup and delivery vehicle routing model with three-dimensional (3D) bal

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Anjuman Ara, Mst. "A Green Vehicle Routing Problem with Simultaneous Delivery and Pickup with Time Windows for Cost Optimization." International Journal of Science and Research (IJSR) 10, no. 2 (2021): 987–92. https://doi.org/10.21275/sr21214113411.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Wang, Xue Feng. "An Location-Routing Problem with Simultaneous Pickup and Delivery in Urban-Rural Dual-Directions Logistics Network." Advanced Materials Research 756-759 (September 2013): 3423–29. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3423.

Повний текст джерела

Анотація:

The design and optimization of urban-rural dual-directions logistics network is a substantial important issue, which will directly affect the development of the urban-rural integration in China. A reasonable scheme of logistics network will contribute to supply efficient logistics services to customers scattering in urban and rural areas. In this paper, we consider a variant of the Location-Routing-Problem (LRP), namely the LRP with simultaneous pickup and delivery in specially background (LRPSB). The objective of LRPSB is to minimize the total system cost, including depot location cost and ve

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Nepomuceno, Napoleão, Ricardo Barboza Saboia, and Plácido Rogério Pinheiro. "A Fast Randomized Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery." Algorithms 12, no. 8 (2019): 158. http://dx.doi.org/10.3390/a12080158.

Повний текст джерела

Анотація:

In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neighbor strategy to tackle an extension of the VRPSPD in which the fleet of vehicles is heterogeneous. This variant is an NP-hard problem, which in practice makes it impossible to be solved to proven optimality for large instances. To evaluate the proposal, we use benchmark instances from the literature and compare our results to those obtained by

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Wu, Xue, Dawei Hu, and Tianyang Gao. "Green pickup and delivery problem with private drivers for crowd-shipping distribution considering traffic congestion." International Journal of Industrial Engineering Computations 16, no. 1 (2025): 129–46. https://doi.org/10.5267/j.ijiec.2024.10.006.

Повний текст джерела

Анотація:

Crowd-shipping, employing private drivers to partially replace company-owned trucks in distribution, has emerged as a prominent trend for its cost-effectiveness and sustainability. While crowd-shipping is known as a distribution pattern that combines economic efficiency and environmental benefits, however, the frequent occurrence of traffic congestion has made this pattern less effective than it should be. In this research, the problem of vehicle routing optimization under traffic congestion is investigated from the perspective of simultaneously reducing environmental pollution and costs. Cons

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Huang, Pengfei, Hao Wang, Fangjiao Tan, Yuyue Jiang, and Jinfen Cai. "Optimization of external container delivery and pickup scheduling based on appointment mechanism." PLOS ONE 20, no. 2 (2025): e0318606. https://doi.org/10.1371/journal.pone.0318606.

Повний текст джерела

Анотація:

Port transport efficiency has become an urgent issue that needs to be improved, especially the coordination among truck drivers during peak hours. Previous studies mainly focus on one-way container transportation logistics issues, but container movements often occur simultaneously in both directions in practice. Therefore, this study aims to minimize truck companies’ operational costs by establishing an optimization model for external truck scheduling. This model takes soft time windows and an appointment feedback mechanism into consideration. Building upon the traditional Ant Colony Optimizat

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Berahhou, Amina, Youssef Benadada, and Khaoula Bouanane. "Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup." International Journal of Industrial Engineering Computations 13, no. 4 (2022): 587–600. http://dx.doi.org/10.5267/j.ijiec.2022.6.001.

Повний текст джерела

Анотація:

In recent years, the Vehicle Routing Problem (VRP) has become an important issue for distribution companies. Also, the rapid development of communication means and the appearance of reverse logistics have given rise to new variants of the VRP. This article deals with an important variant of the VRP which is Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP), in which new customers appear during the working day and each customer requires simultaneous delivery and pickup. A Memetic Algorithm (MA) that combines Genetic Algorithm (GA) and local search procedure have be

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Christopher, Yulio, Sapti Wahyuningsih, and Darmawan Satyananda. "ALGORITMA VARIABLE NEIGHBORHOOD DESCENT (VND) PADA VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICKUP (VRPSDP) DAN IMPLEMENTASINYA." Jurnal Kajian Matematika dan Aplikasinya (JKMA) 2, no. 1 (2021): 5. http://dx.doi.org/10.17977/um055v2i12021p5-13.

Повний текст джерела

Анотація:

Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Routing Problem (VRP). VRPSDP has special constraints, namely requests and returns are carried out simultaneously. In this article we will use the Variable Neighborhood Descent (VND) algorithm to solve VRPSDP problems. There are two steps taken to use the VND algorithm on VRPSDP, namely finding an initial solution with the Insertion Heuristic algorithm and improving the position of the customer by using the neighborhood operator on the VND algorithm. The implementation of the VND algorithm on VRPSDP

Стилі APA, Harvard, Vancouver, ISO та ін.

36

He, Yandong, Xu Wang, Fuli Zhou, and Yun Lin. "Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery." Kybernetes 49, no. 4 (2019): 1267–84. http://dx.doi.org/10.1108/k-05-2018-0236.

Повний текст джерела

Анотація:

Purpose This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile delivery in which three decisions have to be made: determine routes that lie along the HD points and CP facilities; optimize routes in real time, which mode is better between simultaneous dual service (SDS, HD points and CP facilities are served simultaneously by the same vehicle); and respective dual service (RDS, HD points and CP facilities are served by different vehicles)? Design/methodology/approach This paper

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Wang, Chuan Sheng, and Yue Qiu. "Vehicle Routing Problem with Stochastic Demands and Simultaneous Delivery and Pickup." Applied Mechanics and Materials 148-149 (December 2011): 810–13. http://dx.doi.org/10.4028/www.scientific.net/amm.148-149.810.

Повний текст джерела

Анотація:

In this paper vehicle routing problem with stochastic demands and simultaneous delivery and pickup is developed and analyzed, which is an important expansion of classical Vehicle Routing Problem(VRP).An effective algorithm based on Important Sampling is designed to solve the model. The optimal importance sampling distribution function was obtained by making use of the expection constructed by likelihood ratio. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Wang, Chuansheng, and Yue Qiu. "Vehicle Routing Problem with Stochastic Demands and Simultaneous Delivery and Pickup." Advanced Science Letters 19, no. 8 (2013): 2436–39. http://dx.doi.org/10.1166/asl.2013.4894.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Abedinzadeh, Setareh. "A Two-Echelon Green Supply Chain with Simultaneous Pickup and Delivery." International Journal of Transportation Engineering and Technology 3, no. 2 (2017): 12. http://dx.doi.org/10.11648/j.ijtet.20170302.11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Nadizadeh, Ali, and Behzad Kafash. "Fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands." Transportation Letters 11, no. 1 (2017): 1–19. http://dx.doi.org/10.1080/19427867.2016.1270798.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

P, Aravind, Deepak Eldho Babu, and Brijesh Paul. "A Review of Vehicle Routing Problem with Simultaneous Pickup and Delivery." International Journal of Engineering Trends and Technology 15, no. 4 (2014): 203–5. http://dx.doi.org/10.14445/22315381/ijett-v15p240.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Zhao, Yanwei, Longlong Leng, Jingling Zhang, Chunmiao Zhang, and Wanliang Wang. "Evolutionary Hyperheuristics for Location-Routing Problem with Simultaneous Pickup and Delivery." Complexity 2020 (February 28, 2020): 1–24. http://dx.doi.org/10.1155/2020/9291434.

Повний текст джерела

Анотація:

This paper presents an evolution-based hyperheuristic (EHH) for addressing the capacitated location-routing problem (CLRP) and one of its more practicable variants, namely, CLRP with simultaneous pickup and delivery (CLRPSPD), which are significant and NP-hard model in the complex logistics system. The proposed approaches manage a pool of low-level heuristics (LLH), implementing a set of simple, cheap, and knowledge-poor operators such as “shift” and “swap” to guide the search. Quantum (QS), ant (AS), and particle-inspired (PS) high-level learning strategies (HLH) are developed as evolutionary

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Zhou, Jian, Hui Li, Yujie Gu, et al. "A novel two-phase approach for the bi-objective simultaneous delivery and pickup problem with fuzzy pickup demands." International Journal of Production Economics 234 (April 2021): 108057. http://dx.doi.org/10.1016/j.ijpe.2021.108057.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Qin, Gaoyuan, Fengming Tao, Lixia Li, and Zhenyu Chen. "Optimization of the simultaneous pickup and delivery vehicle routing problem based on carbon tax." Industrial Management & Data Systems 119, no. 9 (2019): 2055–71. http://dx.doi.org/10.1108/imds-02-2019-0102.

Повний текст джерела

Анотація:

Purpose In order to reduce logistics transportation costs and respond to low-carbon economy, the purpose of this paper is to study the more practical and common simultaneous pickup and delivery vehicle routing problem, which considers the carbon tax policy. A low-carbon simultaneous pickup and delivery vehicle routing problem model is constructed with the minimum total costs as the objective function. Design/methodology/approach This study develops a mathematical optimization model with the minimum total costs, including the carbon emissions costs as the objective function. An adaptive genetic

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Ge, Jie, and Yan Sun. "Solving a Multimodal Routing Problem with Pickup and Delivery Time Windows under LR Triangular Fuzzy Capacity Constraints." Axioms 13, no. 4 (2024): 220. http://dx.doi.org/10.3390/axioms13040220.

Повний текст джерела

Анотація:

This study models a container routing problem using multimodal transportation to improve its economy, timeliness, and reliability. Pickup and delivery time windows are simultaneously formulated in optimization to provide the shipper and the receiver with time-efficient services, in which early pickup and delayed delivery can be avoided, and nonlinear storage periods at the origin and the destination can be minimized. Furthermore, the capacity uncertainty of the multimodal network is incorporated into the advanced routing to enhance its reliability in practical transportation. The LR triangular

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Moura, Ana, Telmo Pinto, Cláudio Alves, and José Valério de Carvalho. "A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup." Mathematics 11, no. 3 (2023): 713. http://dx.doi.org/10.3390/math11030713.

Повний текст джерела

Анотація:

This work presents a hybrid approach to solve a distribution problem of a Portuguese company in the automotive industry. The objective is to determine the minimum cost for daily distribution operations, such as collecting and delivering goods to multiple suppliers. Additional constraints are explicitly considered, such as time windows and loading constraints due to the limited capacity of the fleet in terms of weight and volume. An exhaustive review of the state of the art was conducted, presenting different typology schemes from the literature for the pickup and delivery problems in the distr

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Li, Bing, Ce Yun, Guanglan Xu, Xiaoqian Zhou, and Hua Xuan. "Optimization of Simultaneous Delivery and Pickup Wagon Scheme on Hybrid Siding Network of Railway Terminal." Discrete Dynamics in Nature and Society 2022 (May 11, 2022): 1–17. http://dx.doi.org/10.1155/2022/6713617.

Повний текст джерела

Анотація:

Aiming at the local freight train transit system in railway terminal, the optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network is presented. The problem is formulated as a mathematical programming model. The objective function intends to minimize shunting engines’ operating cost, wagons’ travelling cost, and penalty cost for exceeding the retrieval time window. Some constraints indicating the relationship between delivery and pickup wagons, relationship between radial branches and operation batches, relationship between local wagon groups’ retrieved time and o

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Khodashenas, Mohammad, Seyed Esmaeel Najafi, Hamed Kazemipoor, and Movahedi Sobhani. "Providing an integrated multi-depot vehicle routing problem model with simultaneous pickup and delivery and package layout under uncertainty with fuzzy-robust box optimization method." Decision Making: Applications in Management and Engineering 6, no. 2 (2023): 372–403. http://dx.doi.org/10.31181/dmame622023640.

Повний текст джерела

Анотація:

This paper modeled and solved an integrated multi-depot vehicle routing problem (MDVRP) with simultaneous pickup and delivery (SPD) with package layout under unpredictable pickup, delivery, and transfer costs. The model described in this paper is divided into two stages. In the first stage, the SCA algorithm is used to optimize the package dimensions (a collection of commodities consumers need). The NSGA II and MOALO algorithms are used in the second stage to optimize the three objective functions of 1 simultaneously) minimizing total costs, 2) minimizing co2 emissions, and 3) minimizing the m

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Suprayogi, Suprayogi, and Yusuf Priyandari. "Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup." Jurnal Teknik Industri 19, no. 2 (2018): 75. http://dx.doi.org/10.9744/jti.19.2.75-82.

Повний текст джерела

Анотація:

This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. In this paper, a solution approach based on tabu search (TS) is proposed. In the proposed TS, the sequential insertion (SI) algorithm is used to construct an initial solution. A neighbor structure is generated by applying an operator order consisting of eleven operators of relocation, exchange, a

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Bouanane, Khaoula, Mohammed El Amrani, and Youssef Benadada. "The Vehicle Routing Problem with Simultaneous Delivery and Pickup: A taxonomic survey." International Journal of Logistics Systems and Management 1, no. 1 (2020): 1. http://dx.doi.org/10.1504/ijlsm.2020.10036700.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!