0000000000311428

AUTHOR

Gianpaolo Ghiani

0000-0002-5243-1799

showing 2 related works from this author

Some personal views on the current state and the future of locational analysis

1998

In this paper a group of participants of the 12th European Summer Institute which took place in Tenerife, Spain in June 1995 present their views on the state of the art and the future trends in Locational Analysis. The issues discussed include modeling aspects in discrete Location Theory, the influence of the distance function, the relation between discrete, network and continuous location, heuristic techniques, the state of technology and undesirable facility location. Some general questions are stated regarding the applicability of location models, promising research directions and the way technology affects the development of solution techniques.

050210 logistics & transportation021103 operations researchInformation Systems and ManagementGeneral Computer ScienceRelation (database)Operations researchComputer scienceHeuristic05 social sciences0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchLocation theoryIndustrial and Manufacturing EngineeringFacility location problemModeling and Simulation0502 economics and businessState (computer science)European Journal of Operational Research
researchProduct

Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm

2019

Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…

Branch-and-boundApplied MathematicsTime dependenceUpper and lower boundsTravelling salesman problemSet (abstract data type)Traveling salesman problemExact algorithmTime windowsLower and upper boundTime windowDiscrete Mathematics and CombinatoricsApplied mathematicsConstant (mathematics)Discrete Mathematics and CombinatoricMathematics
researchProduct