This paper considers how an online food delivery platform can improve last-mile delivery services’ performance using multi-source data. The delivery time is one critical but uncertain factor for online platforms that also regarded as the main challenges in order assignment and routing service. To tackle this challenge, we propose a data-driven optimization approach that combines machine learning techniques with capacitated vehicle routing optimization. Machine learning methods can provide more accurate predictions and have received increasing attention in the operations research field. However, different from the traditional predict-then-optimize paradigm, we use a new smart predict-then-optimize framework, whose prediction objective is constructed by decision error instead of prediction error when implementing machine learning. Using this type of prediction, we can obtain a more accurate decision in the following optimization step. Efficient mini-batching gradient and heuristic algorithms are designed to solve the joint order assignment and routing problem of last-mile delivery service. Besides, this paper considers the mutual effect between routing decision and delivery time, and provides the corresponding solution algorithm. In addition, this paper conducts a computational study and finds that the proposed method’s performance has an approximate 5% improvement compared with other methods.
1 January 2021 in Computational Intelligence and Neuroscience
Increased frequency of disasters keeps reminding us of the importance of effective resource distribution in postdisaster. To reduce the suffering of victims, this paper focuses on how to establish an effective emergency logistics system. We first propose a multiobjective optimization model in which the location and allocation decisions are made for a three‐level logistics network. Three objectives, deprivation costs, unsatisfied demand costs, and logistics cost, are adopted in the proposed optimization model. Several cardinality and flow balance constraints are considered simultaneously. Then, we design a novel effective IFA‐GA algorithm by combining the firefly algorithm and genetic algorithm to solve this complex model effectively. Furthermore, three schemes are proposed to improve the effectiveness of the IFA‐GA algorithm. Finally, the numerical results provide several insights on the theory and practice of relief distribution, which also illustrate the validity of the proposed solution algorithm.
This paper investigates how a random supply can influence management decisions under pull and push contracts in a decentralized supply chain with one supplier and one retailer. We suppose that the supplier faces yield uncertainty, and we adopt game models to analyse the supply chain members’ decisions (i.e., wholesale price and order quantity) under the two commonly used contracts. Specifically, we analyse the revenue sharing mechanism and buyback mechanism with pull and push contracts, respectively, and find that the buyback contract can efficiently coordinate the supply chain with push contract, while the revenue sharing contract cannot improve the performance with a pull contract. Then we design a modified revenue sharing contract that introduces a subsidy for excess inventory and shows that for the pull case, the proposed mechanism can coordinate the supply chain effectively. Finally, the analysis results are displayed intuitively by numerical cases.
Seat capacity setting greatly affects vehicle capacity. Increasing the number of seats allows more passengers to benefit from comfortable travel conditions but reduces the available space for standing passengers and the total capacity of the vehicle. By reducing the number of seats, the operator increases the capacity of the vehicle but most passengers do not find an available seat. Without changing the size of the bus, the operator chooses the desirable seat capacity when purchasing the bus, which can maximize vehicle capacity and allow passengers to have more opportunities to get a seat. Considering capacity constraints, this paper establishes multiple origins and a single destination equilibrium model to study the travel behaviors during peak-period. A bi-level programming model is considered to meet the equilibrium cost. The result shows that we succeed in finding an optimal seat capacity to make the total travel cost be lowest.