Delivery Traveling Salesman Problem with LIFO Loading Francesco Carrabs Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and Center for Research on Trasportation HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 [email protected]...

A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall network load should be balanced among the available servers. We consider a problem formulation based on an estimation of the expected number of requests per movie during the period of highest user interest. Apart from load balanci...

The frequency assignment is an important task in the design of radio network. Let us concider a GSM network N composed of a set of nc cells: C= {C1, C2 . . . Ci, . . . Cnc}. Each cell required a number of frequencies which is defined by the number of transceivers TRX or traffic demand Di= {1, 2 . . . , x}An interval of operational frequencies: [Fmax − Fmin]. Further, consider a matrix: MCo[nc][...

In this paper, a new hybrid metaheuristic learning algorithm is introduced to choose the best parameters for the multi-criteria decision making algorithm (MCDA) called PROAFTN. PROAFTN requires values of several parameters to be determined prior to classification. These parameters include boundaries of intervals and relative weights for each attribute. The proposed learning algorithm, identifie...

This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the d...

The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weights of satisfied clauses) in a Boolean formu...

Attribute reduction is a combinational optimization problem in data mining domain that aims to find a minimal subset from a large set of attributes. The typical high dimensionality of datasets precludes the use of greedy methods to find reducts because of its poor adaptability, and requires the use of stochastic methods. Variable Neighborhood Search (VNS) is a recent metaheuristic and have been...

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. Th...

We present a variable neighborhood search for the vehicle routing problem with compartments where we incorporate some features specifically aiming at the packing aspect. Among them we use a measure to distinguish packings and favor solutions with a denser packing, propose new neighborhood structures for shaking, and employ best-fit and best-fit-decreasing methods for inserting orders. Our appro...