Mathematical simulation of package delivery optimization using a combination of carriers

• URL: http://arxiv.org/abs/2011.01200v1
• Date: Mon, 2 Nov 2020 18:44:04 GMT
• Title: Mathematical simulation of package delivery optimization using a combination of carriers
• Authors: Valentyn M. Yanchuk, Andrii G. Tkachuk, Dmitry S. Antoniuk, Tetiana A. Vakaliuk, and Anna A. Humeniuk
• Abstract summary: Authors analyzed and proposed a solution for the problem of cost optimization for packages delivery for long-distance deliveries using a combination of paths delivered by supplier fleets, worldwide and local carriers. Experiment is based on data sources of the United States companies using a wide range of carriers for delivery services.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A variety of goods and services in the contemporary world requires permanent improvement of services e-commerce platform performance. Modern society is so deeply integrated with mail deliveries, purchasing of goods and services online, that makes competition between service and good providers a key selection factor. As long as logistic, timely, and cost-effective delivery plays important part authors decided to analyze possible ways of improvements in the current field, especially for regions distantly located from popular distribution centers. Considering both: fast and lazy delivery the factor of costs is playing an important role for each end-user. Given work proposes a simulation that analyses the current cost of delivery for e-commerce orders in the context of delivery by the Supplier Fleet, World-Wide delivery service fleet, and possible vendor drop-ship and checks of the alternative ways can be used to minimize the costs. The main object of investigation is focused around mid and small businesses living far from big distribution centers (except edge cases like lighthouses, edge rocks with very limited accessibility) but actively using e-commerce solutions for daily activities fulfillment. Authors analyzed and proposed a solution for the problem of cost optimization for packages delivery for long-distance deliveries using a combination of paths delivered by supplier fleets, worldwide and local carriers. Data models and Add-ons of contemporary Enterprise Resource Planning systems were used, and additional development is proposed in the perspective of the flow selection change. The experiment is based on data sources of the United States companies using a wide range of carriers for delivery services and uses the data sources of the real companies; however, it applies repetitive simulations to analyze variances in obtained solutions.

Related papers

• Deep Reinforcement Learning for Traveling Purchaser Problems [63.37136587778153]
  The traveling purchaser problem (TPP) is an important optimization problem with broad applications. We propose a novel approach based on deep reinforcement learning (DRL), which addresses route construction and purchase planning separately. By introducing a meta-learning strategy, the policy network can be trained stably on large-sized TPP instances.
  arXiv  Detail & Related papers  (2024-04-03T05:32:10Z)
• Optimal Data Splitting in Distributed Optimization for Machine Learning [85.99744701008802]
  This study focuses on an optimal ratio of distributed data between the server and local machines for any costs of communications and local computations. The running times of the network are compared between uniform and optimal distributions. The superior theoretical performance of our solutions is experimentally validated.
  arXiv  Detail & Related papers  (2024-01-15T16:30:12Z)
• Adaptive Resource Allocation for Virtualized Base Stations in O-RAN with Online Learning [60.17407932691429]
  Open Radio Access Network systems, with their base stations (vBSs), offer operators the benefits of increased flexibility, reduced costs, vendor diversity, and interoperability. We propose an online learning algorithm that balances the effective throughput and vBS energy consumption, even under unforeseeable and "challenging'' environments. We prove the proposed solutions achieve sub-linear regret, providing zero average optimality gap even in challenging environments.
  arXiv  Detail & Related papers  (2023-09-04T17:30:21Z)
• Individually Rational Collaborative Vehicle Routing through Give-And-Take Exchanges [4.266376725904727]
  We introduce a novel multi-agent approach to this problem, focusing on the Collaborative Vehicle Routing Problem (CVRP) through the lens of individual rationality. By facilitating cooperation among competing logistics agents through a Give-and-Take approach, we show that it is possible to reduce travel distance and increase operational efficiency system-wide.
  arXiv  Detail & Related papers  (2023-08-31T07:18:37Z)
• Large Language Models for Supply Chain Optimization [4.554094815136834]
  We study how Large Language Models (LLMs) can help bridge the gap between supply chain automation and human comprehension and trust thereof. We design OptiGuide -- a framework that accepts as input queries in plain text, and outputs insights about the underlying outcomes. We demonstrate the effectiveness of our framework on a real server placement scenario within Microsoft's cloud supply chain.
  arXiv  Detail & Related papers  (2023-07-08T01:42:22Z)
• ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest [60.841761065439414]
  At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost.
  arXiv  Detail & Related papers  (2022-05-24T02:28:58Z)
• Concepts and Algorithms for Agent-based Decentralized and Integrated Scheduling of Production and Auxiliary Processes [78.120734120667]
  This paper describes an agent-based decentralized and integrated scheduling approach. Part of the requirements is to develop a linearly scaling communication architecture. The approach is explained using an example based on industrial requirements.
  arXiv  Detail & Related papers  (2022-05-06T18:44:29Z)
• Learning to Minimize Cost-to-Serve for Multi-Node Multi-Product Order Fulfilment in Electronic Commerce [3.3865605512957457]
  We find that the cost of delivery of products from the most node in the supply chain is a key challenge. The large scale, highproblemity, and large geographical spread of e-commerce supply chains make this setting ideal for a carefully designed data-driven decision-making algorithm. We show that a reinforcement learning based algorithm is competitive with these policies, with the potential of efficient scale-up in the real world.
  arXiv  Detail & Related papers  (2021-12-16T09:42:40Z)
• A Deep Reinforcement Learning Approach for Constrained Online Logistics Route Assignment [4.367543599338385]
  It is crucial for the logistics industry on how to assign a candidate logistics route for each shipping parcel properly. This online route-assignment problem can be viewed as a constrained online decision-making problem. We develop a model-free DRL approach named PPO-RA, in which Proximal Policy Optimization (PPO) is improved with dedicated techniques to address the challenges for route assignment (RA)
  arXiv  Detail & Related papers  (2021-09-08T07:27:39Z)
• Simulation-based Algorithm for Determining Best Package Delivery Alternatives under Three Criteria: Time, Cost and Sustainability [6.85316573653194]
  This paper develops a simulation algorithm that assists same-day package delivery companies to serve customers instantly. The proposed recommender system provides the best solution with respect to three criteria: cost, time, and sustainability. This paper also considers the best delivery alternative during the presence of a pandemic, such as COVID-19.
  arXiv  Detail & Related papers  (2021-06-05T18:17:09Z)
• Optimal Pricing of Internet of Things: A Machine Learning Approach [105.4312167370975]
  Internet of things (IoT) produces massive data from devices embedded with sensors. Previous research does not address the problem of optimal pricing and bundling of machine learning-based IoT services. We present an IoT market model which consists of data vendors selling data to service providers, and service providers offering IoT services to customers.
  arXiv  Detail & Related papers  (2020-02-14T09:17:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.