Search results for " optimization"
showing 10 items of 2367 documents
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
2019
Abstract In the commodity-constrained split delivery vehicle routing problem (C-SDVRP), customer demands are composed of sets of different commodities. The C-SDVRP asks for a minimum-distance set of routes such that all customer demands are met and vehicle capacities are respected. Moreover, whenever a commodity is delivered by a vehicle to a customer, the entire amount requested by this customer must be provided. Different commodities demanded by one customer, however, can be delivered by different vehicles. Thus, the C-SDVRP is a relaxation of the capacitated vehicle routing problem and a restriction of the split delivery vehicle routing problem. For its exact solution, we propose a branc…
New exact methods for the time-invariant berth allocation and quay crane assignment problem
2019
Abstract Efficient management of operations in seaport container terminals has become a critical issue, due to the increase in maritime traffic and the strong competition between ports. In this paper we focus on two seaside operational problems: the Berth Allocation Problem and the Quay Crane Assignment Problem, which are considered in an integrated way. For the continuous BACAP problem with time-invariant crane assignment we propose a new mixed integer linear model in which the vessels can be moored at any position on the quay, not requiring any quay discretization. The model is enhanced by adding several families of valid inequalities. The resulting model is able to solve instances with u…
The berth allocation problem in terminals with irregular layouts
2019
As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
2017
Abstract With their paper “Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be solved iteratively when vehicle routing and scheduling problems are tackled via Lagrangian relaxation or column-generation techniques. Righini and Salani and several subsequent works have shown that bounded bidirectional DP algorithms are often superior to their monodirectional counterparts, s…
Irregular packing problems: a review of mathematical models
2020
Abstract Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical …
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
The Chinese Postman Problem with Load-Dependent Costs
2018
[EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the moment it is traversed. This problem is inspired by the perspective of minimizing pollution in transportation, since the amount of pollution emitted by a vehicle not only depends on the travel distance but also on its load, among other factors. We define the problem, study its computational complexity, provide two mathematical programming formulations, and propose two metaheuristics for its soluti…
Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems
2019
Abstract This work focuses on a broad class of uncapacitated p-hub median problems that includes non-stop services and setup costs for the network structures. In order to capture both the single and the multiple allocation patterns as well as any intermediate case of interest, we consider the so-called r-allocation pattern with r denoting the maximum number of hubs a terminal can be allocated to. We start by revisiting an optimization model recently proposed for the problem. For that model, we introduce several families of valid inequalities as well as optimality cuts. Moreover, we consider a relaxation of the model that contains several sets of set packing constraints. This motivates a pol…
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
2019
In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a m…
Multi-criteria analysis applied to multi-objective optimal pump scheduling in water systems
2019
Abstract This work presents a multi-criteria-based approach to automatically select specific non-dominated solutions from a Pareto front previously obtained using multi-objective optimization to find optimal solutions for pump control in a water supply system. Optimal operation of pumps in these utilities is paramount to enable water companies to achieve energy efficiency in their systems. The Fuzzy Technique for Order of Preference by Similarity to Ideal Solution (FTOPSIS) is used to rank the Pareto solutions found by the non-dominated sorting genetic algorithm (NSGA-II) employed to solve the multi-objective problem. Various scenarios are evaluated under leakage uncertainty conditions, res…