Study on continuous network design problem using simulated annealing and genetic algorithm

Xu, Tianhua; Wei, Heng; Hu, Guanghua

doi:10.1016/j.eswa.2007.11.023

Cited by 92 publications

(56 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Xiao et al [32] also examined this situation to explain why uneven geographical positions have an influence on fuel cost savings in a similar model. Xu et al [35,36] found continual network-design problems (CNDP), and declared that if demand is large, SA is more efficient than GA. However, when demand is light, GA is currently able to achieve a more optimal solution.…”

Section: Model Formationmentioning

confidence: 99%

Low Carbon Footprint Routes for Bird Watching

Fang¹,

Huang

Chou

et al. 2015

Sustainability

View full text Add to dashboard Cite

Abstract:Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching's ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA) and genetic algorithms (GA). We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes. OPEN ACCESSSustainability 2015, 7 3291

show abstract

Section: Model Formationmentioning

confidence: 99%

Low Carbon Footprint Routes for Bird Watching

Fang¹,

Huang

Chou

et al. 2015

Sustainability

View full text Add to dashboard Cite

show abstract

“…Due to the complexity of the problem, many metaheuristics were proposed in the literature. Friesz et al (1992Friesz et al ( , 1993 and Meng and Yang (2002) used simulated annealing procedures and Xu et al (2009) and Mathew and Sharma (2009) used genetic algorithms for solving the problem. Wang and Lo (2010) transformed the bilevel problem into a MILP by transforming the equilibrium constraints into mixed-integer constraints and linearizing the travel time function.…”

Section: Discrete Network Design Problemmentioning

confidence: 99%

Methodological Advances and New Formulations for Bilevel Network Design Problems

Fontaine

2018

Operations Research Proceedings

View full text Add to dashboard Cite

“…It tries to escape from local optima by accepting worse solutions during its search with a probability which is monotonically decreasing by temperature. SA was first introduced by (Metropolis, Rosenbluth et al 1953) and has been applied to various combinatorial optimization problems such as scheduling (Damodaran and Vélez-Gallego 2012), facility layout (Wang, Wu et al 2001), and network design (Xu, Wei et al 2009). …”

Section: Simulated Annealingmentioning

confidence: 99%

Capacitated location-routing problem with time windows under uncertainty

Zarandi

Hemmati

Davari

et al. 2013

Knowledge-Based Systems

View full text Add to dashboard Cite

This paper puts forward a location-routing problem with time windows (LRPTW) under uncertainty. It has been assumed that demands of customers and travel times are fuzzy variables. A fuzzy chance constrained programming (CCP) model has been designed using credibility theory and a simulation-embedded simulated annealing (SA) algorithm is presented in order to solve the problem. To initialize solutions of SA, a heuristic method based on fuzzy c-means (FCM) clustering with Mahalanobis distance and sweep method has been employed. The numerical experiments which were carried out, clearly attest that the proposed solution approach is both effective and robust in solving problems with up to 100 demand nodes in reasonable times.

show abstract

Study on continuous network design problem using simulated annealing and genetic algorithm

Cited by 92 publications

References 12 publications

Low Carbon Footprint Routes for Bird Watching

Low Carbon Footprint Routes for Bird Watching

Methodological Advances and New Formulations for Bilevel Network Design Problems

Capacitated location-routing problem with time windows under uncertainty

Contact Info

Product

Resources

About