The single-vehicle routing problem with unrestricted backhauls

Date

2003-05-01

Author

Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

194
views

0
downloads

Suppose that a private carrier delivers to a set of customers and also has a number of (optional) backhaul opportunities. It wants to choose the best of these, depending on the revenue generated, and insert them in a revised tour. This will be at an expense of deviation from the original tour, because, here, deliveries need not precede backhauls. The problem is to find the mixed tour whose net cost is the lowest, selecting the most profitable backhauls subject to the overall capacity. We thus generalize several other vehicle routing problems with backhauls. A mixed-integer model is developed for the problem. It is based on Miller-Tucker-Zemlin subtour elimination constraints. We address several improvement techniques aimed at increasing computational tractability of the formulation. Computational results show that medium-sized problems can be solved optimally in a reasonable time by using a general-purpose commercial solver. (C) 2003 Wiley Periodicals, Inc.

Subject Keywords

Vehicle routing with backhauls, Mixed pickup and delivery, Private carriage

URI

https://hdl.handle.net/11511/35025

Journal

NETWORKS

DOI

https://doi.org/10.1002/net.10067

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A min-max vehicle routing problem with split delivery and heterogeneous demand Yakici, Ertan; Karasakal, Orhan (2013-10-01) In this article, we introduce a new variant of min-max vehicle routing problem, where various types of customer demands are satisfied by heterogeneous fleet of vehicles and split delivery of services is allowed. We assume that vehicles may serve one or more types of service with unlimited service capacity, and varying service and transfer speed. A heuristic solution approach is proposed. We report the solutions for several test problems.
A column generation approach for the location-routing problem with time windows Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01) The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...
A cooperative shipment consolidation game with emission considerations Keven, Halit.; Savaşaneril Tüfekci, Seçil; Department of Industrial Engineering (2020) Logistic operations constitute one of the most significant cost components for many companies. Furthermore, these activities have turned out to be one of the main causes of carbon emissions in the world. The carbon emission issue has been under the spotlight in many countries due to the rising concerns about global warming which brought about new regulations. Large majority of these regulations tend to increase the total costs of logistic operations by a variable factor directly related to carbon emission a...
The planar hub location problem: a probabilistic clustering approach İyigün, Cem (Springer Science and Business Media LLC, 2013-12-01) Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.
The multiple retailer inventory routing problem with backorders Alişan, Onur; Süral, Haldun; Department of Industrial Engineering (2008) In this study we consider an inventory routing problem in which a supplier distributes a single product to multiple retailers in a finite planning horizon. Retailers should satisfy the deterministic and dynamic demands of end customers in the planning horizon, but the retailers can backorder the demands of end customers considering the supply chain costs. In each period the supplier decides the retailers to be visited, and the amount of products to be supplied to each retailer by a fleet of vehicles. The de...

Citation Formats

H. Süral, “The single-vehicle routing problem with unrestricted backhauls,” NETWORKS, pp. 127–136, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35025.