Heuristics for NP-hard Optimization Problems - Simpler is Better!?

The authors provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

• Record URL:
  http://jlst.fl.uni-mb.si/index.php/journal/article/view/61
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/22324968
• Supplemental Notes:
  • © 2015 Janez Žerovnik
• Authors:
  • Žerovnik, Janez
• Publication Date: 2015-12

Language

• English

Media Info

• Media Type: Digital/other
• Features: Figures; References; Tables;
• Pagination: pp 1-10
• Serial:
  • Logistics & Sustainable Transport
  • Volume: 6
  • Issue Number: 1
  • Publisher: De Gruyter Poland
  • ISSN: 2232-4968
  • Serial URL: https://sciendo.com/journal/JLST
• Publication flags:

  Open Access (libre)

Subject/Index Terms

• TRT Terms: Heuristic methods; Optimization; Problem solving; Schedules and scheduling; Traffic assignment; Traveling salesman problem
• Subject Areas: Freight Transportation; Highways; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01588417
• Record Type: Publication
• Files: TRIS
• Created Date: Jan 28 2016 9:01AM