相关论文: A Branch-and-Price Algorithm for the Two-Echelon I…

This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously…

Branch-price-and-cut algorithms play an important role in solving many vehicle routing problems (VRPs). Adding valid inequalities in this framework can impact the pricing subproblem, for which the literature distinguishes between 'robust'…

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average…

We introduce the Vehicle Routing Problem with Resource-Constrained Pickup and Delivery (VRP-RPD), where vehicles transport finite identical resources to customer locations for autonomous processing before retrieval and redeployment. Unlike…

This work attempts to combine the strengths of two major technologies that have matured over the last three decades: global mixed-integer nonlinear optimization and branch-and-price. We consider a class of generally nonconvex mixed-integer…

Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly…

This paper addresses a multi-period line planning problem in an integrated passenger-freight railway system, aiming to maximize profit while serving passengers and freight using a combination of dedicated passenger trains, dedicated freight…

Supply chain management is an integrated approach for planning and controlling materials, information, and finances as they move in a process which begins from suppliers and ends with customers in forward approach. As distribution network…

The network pricing problem (NPP) is a bilevel problem, where the leader optimizes its revenue by deciding on the prices of certain arcs in a graph, while expecting the followers (also known as the commodities) to choose a shortest path…

In this work, we investigate the problem of order batching and picker routing in warehouse storage areas. These problems are known to be capital and labour intensive, and often contribute to a sizable fraction of warehouse operating costs.…

We introduce the Pickup and Delivery Problem with Time Windows and Scheduling on the Edges (PDPTW-SE), a generalization of the PDPTW that integrates vehicle routing and machine scheduling. The problem involves defining routes for…

Over the past few years, ride-sharing has emerged as an effective way to relieve traffic congestion. A key problem for these platforms is to come up with a revenue-optimal (or GMV-optimal) pricing scheme and an induced vehicle dispatching…

Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both small-line and multi-line orders. To reduce unproductive picker working time as in traditional…

In this paper, the problem of electric vehicle (EV) charging at the workplace is addressed via a two-layer predictive algorithm. We consider a time of use (TOU) pricing model for energy drawn from the grid and try to minimize the charging…

The electric autonomous dial-a-ride problem (E-ADARP) introduces electric, autonomously driving vehicles and their unique requirements into the classic dial-a-ride problem, where people are transported between pickup and drop-off locations.…

Matching and pricing are two critical levers in two-sided marketplaces to connect demand and supply. The platform can produce more efficient matching and pricing decisions by batching the demand requests. We initiate the study of the…

This paper investigates a two-echelon inventory system with a central warehouse and N (N > 2) retailers managed by a centralized information-sharing mechanism. In particular, the paper mathematically models an easy-to-implement inventory…

For NP-hard combinatorial optimization problems, it is usually difficult to find high-quality solutions in polynomial time. The design of either an exact algorithm or an approximate algorithm for these problems often requires significantly…

We consider a single-echelon inventory system under periodic review with two suppliers facing stochastic demand, where excess demand is backlogged. The expedited supplier has a shorter lead time than the regular supplier but charges a…

Districting-and-routing is a strategic problem aiming to aggregate basic geographical units (e.g., zip codes) into delivery districts. Its goal is to minimize the expected long-term routing cost of performing deliveries in each district…