Search results for "TRAVEL"
showing 10 items of 402 documents
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
2021
Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…
A note on the separation of subtour elimination constraints in elementary shortest path problems
2013
Abstract This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.
Separating capacity constraints in the CVRP using tabu search
1998
Abstract Branch and Cut methods have shown to be very successful in the resolution of some hard combinatorial optimization problems. The success has been remarkable for the Symmetric Traveling Salesman Problem (TSP). The crucial part in the method is the cutting plane algorithm: the algorithm that looks for valid inequalities that cut off the current nonfeasible linear program (LP) solution. In turn this part relies on a good knowledge of the corresponding polyhedron and our ability to design algorithms that can identify violated valid inequalities. This paper deals with the separation of the capacity constraints for the Capacitated Vehicle Routing Problem (CVRP). Three algorithms are prese…
Using a TSP heuristic for routing order pickers in warehouses
2010
In this paper, we deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems. For this NP-hard Steiner travelling salesman problem (TSP), exact algorithms only exist for warehouses with at most three cross aisles, while for other warehouse types literature provides a selection of dedicated construction heuristics. We evaluate to what extent reformulating and solving the problem as a classical TSP leads to performance improvements compared to existing dedicated heuristics. We report average savings in route distance of up to 47% when using the LKH (Lin-Kernighan-Helsgaun) TSP heuristic. Additionally, we examine if combining problem-sp…
Optimal Paths on Urban Networks Using Travelling Times Prevision
2012
We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.
The Rural Postman Problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…
Boundary rigidity for Randers metrics
2021
If a non-reversible Finsler norm is the sum of a reversible Finsler norm and a closed 1-form, then one can uniquely recover the 1-form up to potential fields from the boundary distance data. We also show a boundary rigidity result for Randers metrics where the reversible Finsler norm is induced by a Riemannian metric which is boundary rigid. Our theorems generalize Riemannian boundary rigidity results to some non-reversible Finsler manifolds. We provide an application to seismology where the seismic wave propagates in a moving medium.
Cycling but not walking to work or study is associated with physical fitness, body composition and clustered cardiometabolic risk in young men
2020
IntroductionActive commuting is an inexpensive and accessible form of physical activity and may be beneficial to health. The aim of this study was to investigate the association of active commuting and its subcomponents, cycling and walking, with cardiometabolic risk factors, physical fitness and body composition in young men.MethodsParticipants were 776 Finnish young (26±7 years), healthy adult men. Active commuting was measured with self-report. Waist circumference was measured and body mass index (BMI) calculated. Aerobic fitness was measured with bicycle ergometer and muscular fitness with maximal leg and bench press, sit-ups, push-ups and standing long jump. Cardiometabolic risk factor…
Charcoal and stable soil organic matter as indicators of fire frequency, climate and past vegetation in volcanic soils of Mt. Etna, Sicily
2012
Abstract Charcoal fragments in soils are useful to reconstruct past vegetation because the level of preservation is often good enough to determine the tree genus. All forest ecosystems have the potential to burn as a result of naturally occurring or human-induced fires. Forest fires are coupled to climate and are a not-negligible factor of pedogenesis in Mediterranean areas, where they occur frequently. Furthermore, soil organic matter (SOM) is prone to undergo peculiar changes due to forest fires, both in terms of quantity and quality. A soil sequence along an elevational gradient ranging from Mediterranean to subalpine climate zones on slopes of Mt. Etna (Sicily, Italy) was investigated i…
A Review of 2000 Years of Paleoclimatic Evidence in the Mediterranean
2012
[EN] The integration of climate information from instrumental data and documentary and natural archives; evidence of past human activity derived from historical, paleoecological, and archaeological records; and new climate modeling techniques promises major breakthroughs for our understanding of climate sensitivity, ecological processes, environmental response, and human impact. In this chapter, we review the availability and potential of instrumental data, less well-known written records, and terrestrial and marine natural proxy archives for climate in the Mediterranean region over the last 2000 years. We highlight the need to integrate these different proxy archives and the importance for…