Search results for "Operation"

A multistage heuristic for storage and retrieval problems in a warehouse with random storage

2017

The warehouse is one of the essential components of logistics and supply chains. The efficiency of the whole chain is affected by the performance of warehouse operations and, more particularly, the storage and retrieval of goods. This paper considers a storage and retrieval problem in a real warehouse with random storage and different types of forklifts, depending on the locations they can access. The problem deals with selecting locations to store/retrieve a predefined set of pallets, assigning an adequately skilled forklift to each operation and determining the order in which each forklift will perform its operations so that the total employed time is minimized. The problem is solved heur…

A parallel variable neighborhood search approach for the obnoxious p -median problem

2018

Interactive Multiobjective Robust Optimization with NIMBUS

2018

In this paper, we introduce the MuRO-NIMBUS method for solving multiobjective optimization problems with uncertain parameters. The concept of set-based minmax robust Pareto optimality is utilized to tackle the uncertainty in the problems. We separate the solution process into two stages: the pre-decision making stage and the decision making stage. We consider the decision maker’s preferences in the nominal case, i.e., with the most typical or undisturbed values of the uncertain parameters. At the same time, the decision maker is informed about the objective function values in the worst case to support her/him to make an informed decision. To help the decision maker to understand the behavio…

A genetic algorithm for the minimum generating set problem

2016

Graphical abstractDisplay Omitted HighlightsWe propose a novel formulation for the MGS problem based on multiple knapsack.The so-conceived MGS problem is solved by a novel GA.The GA embeds an intelligent construction method and specialized crossover operators.We perform a thorough comparison with regards to state-of-the-art algorithms.The proposal proves to be very competitive, specially for large and hard instances. Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinat…

On the sure criticality of tasks in activity networks with imprecise durations

2002

BB; International audience; The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activity duration times is introduced and analyzed. It is shown, in the interval case, that both the problem of asserting whether a given path is necessarily critical and the problem of determining an arbitrary necessarily critical path (more exactly, a subnetwork covering all the necessarily critical. paths) are easy. The corresponding solution algorithms are proposed. However, the problem. of evaluating whether a given activity is necessarily critical does not seem to be such. Certain conditions are…

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

2016

[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…

Matheuristics for the irregular bin packing problem with free rotations

2017

[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems

2018

Abstract For the exact solution of many types of vehicle-routing problems, column-generation based algorithms have become predominant. The column-generation subproblems are then variants of the shortest-path problem with resource constraints which can be solved well with dynamic-programming labeling algorithms. For vehicle-routing problems with a pickup-and-delivery structure, the strongest known dominance between two labels requires the delivery triangle inequality (DTI) for reduced costs to hold. When the direction of labeling is altered from forward labeling to backward labeling, the DTI requirement becomes the pickup triangle inequality (PTI). DTI and PTI cannot be guaranteed at the sam…

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem

2016

Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…

Multi-objective memetic optimization for the bi-objective obnoxious p -median problem

2018

Abstract Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous faci…