The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This article addresses the integrated train blocking and shipment path (TBSP) problem. The problem aims to route and classify railcar flows while satisfying railway line and station capacity constraints. At the same time, the problem tries to minimize the total operational costs. In this article, a new linear arc‐node mathematical model is developed for the TBSP problem. In order to solve the model,...
The minimum cost flow problem with conflicts is a recent extension of the ordinary minimum cost flow problem. It includes flow compatibility restrictions in addition to flow balance equalities and capacity constraints: at most one of the conflicting arcs can have positive flow. In this work we study this extension of the minimum cost flow problem, which can be faced in many real‐world applications...
We present a solution approach for a multi‐trip vehicle routing problem with time windows in which the locations of a prescribed number of depots and the fleet sizes must also be optimized. Given the complexity of the task, we divide the problem into subproblems that are solved sequentially. First, we address strategic decisions, which are solved once and remain constant thereafter. Depots are allocated...
Origin‐destination integer multicommodity flow problems differ from classic multicommodity models in that each commodity has one source and one sink, and each commodity must be routed along a single path. A new invisible‐hand heuristic that mimics economic markets' behavior is presented and tested on large‐scale telecommunications networks, with solution times two orders of magnitude faster than CPLEX's...
We address the problem of routing a fleet of trucks equipped with unmanned aerial vehicles, commonly known as drones, to perform deliveries in last‐mile delivery process. The customers can be served by either a truck or a drone within the respective time window of each. Each capacitated truck carries drones that can be launched to perform deliveries. The drone takes off from a truck located either...
In this article, we investigate a two‐tier delivery network with robots operating on the second tier. We determine the optimal number of local robot hubs as well as the optimal number of robots to service all customers and compare the resulting operational cost to conventional truck‐based deliveries. Based on the well‐known p‐median problem, we present mixed‐integer programs that consider the limited...
The team orienteering problem (TOP) requires a team of time‐constrained agents to maximize the total collected profit by serving a subset of given customers. The exact solution approaches for TOP in the literature have considered only the case of identical agents, even though the heterogeneity of the agents is of essence in many applications. The heuristic approaches, on the other hand, although providing...
We propose a model for solving a parcel delivery problem with a fleet of trucks embedded with drones. When appropriate, drones are loaded with a parcel, launched directly from the truck, and sent to a client. Afterward, the drones autonomously return to the truck to be replenished and recharged. Inspired by the case of a large European logistics provider, the proposed modeling framework confronts...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.