Filters








31 Hits in 6.6 sec

Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

Eric Angel, Evripidis Bampis, Laurent Gourvès
2004 Theoretical Computer Science  
We show that it is possible to get in linear time, a 3 2 -approximate Pareto curve using an original local search procedure based on the 2-opt neighborhood, for the bicriteria TSP(1,2) problem where every  ...  In this paper, we introduce such an approach for the classical traveling salesman problem (TSP) problem (Proc. STOC'00, 2000, pp. 126 -133).  ...  The set of solution(s) returned by the bicriteria local search (BLS) procedure is a 3 2 -approximate Pareto curve for the multicriteria TSP(1; 2) problem.  ... 
doi:10.1016/s0304-3975(03)00376-1 fatcat:tbdh42e2wne35pzttm2mvd24je

Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem [chapter]

Eric Angel, Evripidis Bampis, Laurent Gourvès
2003 Lecture Notes in Computer Science  
We show that it is possible to get in linear time, a 3 2 -approximate Pareto curve using an original local search procedure based on the 2-opt neighborhood, for the bicriteria TSP(1,2) problem where every  ...  In this paper, we introduce such an approach for the classical traveling salesman problem (TSP) problem (Proc. STOC'00, 2000, pp. 126 -133).  ...  The set of solution(s) returned by the bicriteria local search (BLS) procedure is a 3 2 -approximate Pareto curve for the multicriteria TSP(1; 2) problem.  ... 
doi:10.1007/978-3-540-45077-1_5 fatcat:s27batpk2bbvrlldmz7w7loxgq

On the Performance of Local Search for the Biobjective Traveling Salesman Problem [chapter]

Luís Paquete, Thomas Stützle
2010 Studies in Computational Intelligence  
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem. Theoretical Computer Science, 310:135–146, 2004. 2. E. Angel, E. Bampis, and L. Gourvés.  ...  } + d {cπ(i) , cπ(i+1) } i=1 On the Performance of Local Search for the Biobjective TSP 3 Algorithm 1 Pareto Local  ... 
doi:10.1007/978-3-642-11218-8_7 fatcat:m5hrpkgdjrap3o36ngxqnywaza

Page 10488 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
for the bicriteria TSP(1,2) problem.  ...  2004m:90163 2004m:90163 90C35 05C85 68W25 90C29 Angel, Eric (F-EVRY-IFM; Evry) ; Bampis, Evripidis (F-EVRY-IFM; Evry); Gourveés, Laurent (F-EVRY-IFM; Evry) Approximating the Pareto curve with local search  ... 

AUV Optimal Path for Leak Detection [article]

Olivier Marceau, Jean-Michel Vanpeperstraete
2018 arXiv   pre-print
The proposed technique, based on the bayesian search theory framework and multi-objective optimization, extracts optimal boustrophedon paths for leak detection in complex environment.  ...  Thanks to Pareto efficiency approach, our tool propose optimal trajectories for numerous AUV autonomies. Hence it can be used for both real time path planning and design purpose.  ...  With such notations the classical search theory non detection probability can be formulated P N D = n i=1 π i · exp   − 1 τ m j=1 l i,j v j δ j   (2) with l i,j the length of the trackline j inside  ... 
arXiv:1801.02377v1 fatcat:opnrymfvk5fs5kbostiivznqve

Flowshop-scheduling problems with makespan criterion: a review

S. Reza Hejazi *, S. Saghafian
2005 International Journal of Production Research  
Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem.  ...  It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary  ...  best solution to construct a very fast tabu search algorithm for a flowshop problem with makespan criterion. c max ðÞ ¼ cð, uÞ ¼ X u 1 j¼1 p ðjÞ1 þ X u 2 j¼u 1 p ðjÞ2 þ Á Á Á þ X n j¼u mÀ1 p ðjÞm then  ... 
doi:10.1080/0020754050056417 fatcat:gbcqshoqerhnjek2l4uqcmhdr4

(Non)-Approximability for the Multi-criteria TSP(1,2) [chapter]

Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
2005 Lecture Notes in Computer Science  
Previously, Angel et al. [1] proposed a local search algorithm (called BLS) for the bi-criteria T SP (1, 2) which, with only two solutions generated in O(n 3 ), was able to approximate the whole Pareto  ...  This multi-criteria nearest neighbor heuristic works for any k and produces a 3/2-approximate Pareto curve when k ∈ {1, 2} and a 2k/(k + 1)-approximate Pareto curve when k ≥ 3.  ...  Angel et al. present in [1] a local search algorithm (called BLS) for the bi-criteria T SP (1, 2) . This algorithm returns in time O(n 3 ) a 3/2-approximate Pareto curve.  ... 
doi:10.1007/11537311_29 fatcat:t2gwpdbft5hcde3fn2vp4sf26y

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
In the chain, one application produces input load for the next one. MapReduce applications are example of 2-stage chains.  ...  We demonstrate our approach on the routing problem for unmanned air vehicles with minimization of distance traveled and minimization of radar detection threat objectives. , Gokcen Turkel Dynamic scheduling  ...  We measure the machine impact for m machines to the one with m+1 machines. For the makespan, in the preemptive case the impact is (m+1)/m, while in the non-preemptive case the impact is 2.  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Multi-objective combinatorial optimization for selecting best available techniques (BAT) in the industrial sector: the COMBAT tool

G Mavrotas, E Georgopoulou, S Mirasgedis, Y Sarafidis, D Lalas, V Hontou, N Gakis
2009 Journal of the Operational Research Society  
The decision maker progressively drives the search with his answers. The drawback is that he never sees the whole picture (the set of Pareto optimal solutions) or an approximation of it.  ...  function k S: feasible region of the original problem eps: a very small number (10°9 to 10°6) Set number of gridpoints g, (k=2...p) S,: non-negative surplus variables (k=2...p) for the p-1 obj.functions  ... 
doi:10.1057/palgrave.jors.2602618 fatcat:3m443zoicvbnrgguirlffldfcq

Chapter 7 A survey of computational geometry [chapter]

Joseph S.B. Mitchell, Subhash Suri
1995 Handbooks in Operations Research and Management Science  
1 2 J. Mitchell and S. Suri incidences between a set of lines and a set of points, and counting the number of lines that bisect a set of points.  ...  The survey proper begins in Section 3, while Section 2 introduces some foundational material.  ...  Give a polynomial time algorithm for approximating the Euclidean TSP of n points with a performance ratio strictly less than 1.5.  ... 
doi:10.1016/s0927-0507(05)80124-0 fatcat:nogmdqmv6bflni3waox5dxrsiy

Visible Light-Assisted Soft-Chemistry Route to Silver Nanomaterials at Room Temperature

Yi Wu, Xin Liu, Zi Huang, Xiang Fei He, Xi Yang, Qing Li
2019 Key Engineering Materials  
AgNPs were characterized with powder X-ray diffraction (XRD) and scanning electron microscope (SEM). The result showed that the nanoparticles are spherical and cube.  ...  Silver nanoparticles (AgNPs) were synthesizd by a light-assisted liquid phase reduction method with sodium hypophosphite as a reducing agent. DTAB was used to perform as the surfactant.  ...  THU-1-F Contributed Session: Practical Applications of MCDM Accelerating Pareto Local Search Algorithms using Epsilon Dominance for the Beam Angle Optimisation Problem Dimensionality Reduction for  ... 
doi:10.4028/www.scientific.net/kem.807.165 fatcat:xara5sxzf5fsvbib2dy6vrl7j4

Matheuristic algorithms for solving multi-objective/stochastic scheduling and routing problems

Peter Manfred Siegfried Reiter
2010 unpublished
The first application that is considered in this thesis, the Multi-objective Project Selection, Scheduling and Staffing with Learning problem (MPSSSL) arises from the field of management in research-centered  ...  Algorithms for multi-objective optimization problems provide the decision maker a set of efficient solutions, among which she or he can choose the most suitable alternative.  ...  Usually I C P (t) is normalized to keep the metric within [0, 1] by 8) the bicriteria sample average approximation (BSAA) problem corresponding to the original problem (2.6).  ... 
doi:10.25365/thesis.11513 fatcat:3rxh3numorfvldppttbs5zatmq

Greece ACM Classification 1998 F.2 Analysis of Algorithms and Problem Complexity

Atmos', Giuseppe Italiano, Marie Schmidt, Giuseppe Italiano, Marie Schmidt, Daniel Cremers, Barbara Hammer, Marc Langheinrich, Dorothea Wagner, Simeon Andreev, Julian Dibbelt, Martin Nöllenburg (+18 others)
2015 unpublished
CZ.1.07/2.3.00/30.0034), period of the project's realisation is 1 Dec 2012 -30 Jun 2015.  ...  The authors would like to thank Thomas Brechtel for many fruitful Acknowledgments.  ...  INFORMS journal on Computing, 8(2):165-172, 1996. 12 Martin WP Savelsbergh. Local search in routing problems with time windows.  ... 
fatcat:6v4dp44y4zhy7m46hhgqdzmks4

Page 3108 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(English summary) (see 2004m:90003) — (with Bampis, Evripidis; Gourvés, Laurent) Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.  ...  (English summary) 2004g:68010 — (with Bampis, Evripidis; Gourvés, Laurent) A dynasearch neighborhood for the bicriteria traveling salesman problem.  ... 

Università degli Studi di Ferrara DOTTORATO DI RICERCA IN MATEMATICA E INFORMATICA THE BI-OBJECTIVE TRAVELLING SALESMAN PROBLEM WITH PROFITS AND ITS CONNECTION TO COMPUTER NETWORKS DOTTORANDA TUTORE

Xxii° Ciclo, Dott Coordinatore, Zanghirati, Dott Ssa, Elisa Stevanato, Prof Filippi
2007 unpublished
In this thesis we study an extension of the well known Traveling Salesman Problem (TSP): the Traveling Salesman Problem with Profits (TSPP).  ...  Within this context, the aim of this work is to study new ways to solve the problem in both the exact and the approximated settings, giving all feasible instruments that can help to solve it, and to provide  ...  Acknowledgments First of all, I would like to thank my two supervisors: Gaetano Zanghirati (University of Ferrara) and Carlo Filippi (University of Brescia), for their continuous support in the development  ... 
fatcat:gog6jd2i2rehffcdq24bkdgnni
« Previous Showing results 1 — 15 out of 31 results