Search results for " OPT"
showing 10 items of 13620 documents
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…
Applying particle swarm optimization to the motion-cueing-algorithm tuning problem
2017
The MCA tuning problem consists in finding the best values for the parameters/coefficients of Motion Cueing Algorithms (MCA). MCA are used to control the movements of robotic motion platforms employed to generate inertial cues in vehicle simulators. This problem is traditionally approached with a manual pilot-in-the-loop subjective tuning, based on the opinion of several pilots/drivers. Instead, this paper proposes applying Particle Swarm Optimization (PSO) to solve this problem, using simulated motion platforms and objective indicators rather than subjective opinions. Results show that PSO-based tuning can provide a suitable solution for this complex optimization problem.
Using Genetic Algorithms for Optimizing the PPC in the Highway Horizontal Alignment Design.
2016
Various studies have emphasized the interesting advantages related to the use of new transition curves for improving the geometric design of highway horizontal alignments. In a previous paper, one of the writers proposed a polynomial curve, called a polynomial parametric curve (PPC), proving its efficiency in solving several design problems characterized by a very complex geometry (egg-shaped transition, transition between reversing circular curves, semidirect and inner-loop connections, and so on). The PPC also showed considerable advantages from a dynamic perspective, as evidenced by the analysis of the main dynamic variables related to motion (as well as rate of change of radial accelera…
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
2019
This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortes…
The directed profitable rural postman problem with incompatibility constraints
2017
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
Influence of the drawing process on the defect generation in multistep-index germanium-doped optical fibers
2009
International audience; Variation of germanium lone pair center (GLPC) concentration in germanosilicate multistep-index optical fibers and preforms was studied using confocal microscopy luminescence technique. The experimental results provide evidence that in the central core region ([Ge] ~11 wt. % ) of our specific canonical samples the ratio [GLPC]/[Ge] is five times larger in fiber than in preforms. The relative influence of the glass composition and of the drawing process on the generation efficiency of the GLPC defects that drive the glass photosensitivity is discussed. The radial distribution of these defects suggests a possible enhancement of the defect creation related to the intern…