相关论文: Vehicle Routing for the Last-Mile Logistics Proble…

Besides air pollution and commuter stress, traffic congestions also lead to loss of productivity, increase in delay, vehicle operating cost, and accidents. To assuage these issues, several logistics companies are planning to launch air…

VRP (Vehicle Routing Problem) is an NP hard problem, and it has attracted a lot of research interest. In contexts where vehicles have limited carrying capacity, such as volume and weight but needed to deliver items at various locations.…

An increase in greenhouse gases emission from the transportation sector has led companies and the government to elevate and support the production of electric vehicles (EV). With recent developments in urbanization and e-commerce,…

Vehicle routing is a well-known optimization research topic with significant practical importance. Among different approaches to solving vehicle routing, heuristics can produce a satisfactory solution at a reasonable computational cost.…

We propose a two phase time dependent vehicle routing and scheduling optimization model that identifies the safest routes, as a substitute for the classical objectives given in the literature such as shortest distance or travel time,…

Hydrogen is an energy vector, and one possible way to reduce CO 2 emissions. This paper focuses on a hydrogen transport problem where mobile storage units are moved by trucks between sources to be refilled and destinations to meet demands,…

This work focuses on finding optimal locations for charging stations for one-way electric car sharing programs. The relocation of vehicles by a service staff is generally required in vehicle sharing programs in order to correct imbalances…

The Last Mile Delivery (LMD) refers to the last and most inefficient part of the supply chain. This is caused by the spatial distribution of disperse small receiving points, the ever-growing demand for faster shipment and the new time…

Heavy goods vehicles are vital backbones of the supply chain delivery system but also contribute significantly to carbon emissions with only 60% loading efficiency in the United Kingdom. Collaborative vehicle routing has been proposed as a…

We consider various {\em multi-vehicle versions of the minimum latency problem}. There is a fleet of $k$ vehicles located at one or more depot nodes, and we seek a collection of routes for these vehicles that visit all nodes so as to…

The Multiple-Depot Split Delivery Vehicle Routing Problem (MD-SDVRP) is a challenging problem with broad applications in logistics. The goal is to serve customers' demand using a fleet of capacitated vehicles located in multiple depots,…

Microtransit and other flexible transit fleet services can reduce costs by incorporating transfers. However, transfers are costly to users if they must get off a vehicle and wait at a stop for another pickup. A mixed integer linear…

This paper proposes an optimal allocation problem with ramified transport technology in a spatial economy. Ramified transportation is used to model the transport economy of scale in group transportation observed widely in both nature and…

The capacitated location-routing problem involves determining the depots from a set of candidate capacitated depot locations and finding the required routes from the selected depots to serve a set of customers whereas minimizing a cost…

In this paper, we investigate vehicle routing problems with third-party transshipment facilities that arise in the context of city logistics. Contrary to classical vehicle routing problems, where each customer request is delivered directly…

This paper aims to introduce a mathematical model to solve the time-dependent electric vehicles routing problem in shared travels. Shared mobility has gained significance recently due to its contribution to the alleviation of traffic…

In this paper, we present a novel approach for fleet sizing in the context of flash delivery, a time-sensitive delivery service that requires the fulfilment of customer requests in minutes. Our approach effectively combines individual…

The paper addresses the problem of providing suitable reference trajectories in motion planning problems for autonomous vehicles. Among the various approaches to compute a reference trajectory, our aim is to find those trajectories which…

We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning. In this approach, we train a single model that finds near-optimal solutions for problem instances sampled from a given…

We propose a model for optimizing the last-mile delivery of n packages, from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g., Uber or Lyft) with traditional in-house…