Modeling and Solving Difficult-to-Represent Optimization Problems

Akhil Yadav () and Partha Chakroborty ()
Additional contact information
Akhil Yadav: Department of Civil Engineering, Indian Institute of Technology
Partha Chakroborty: Department of Civil Engineering, Indian Institute of Technology

Chapter Chapter 25 in Optimization Essentials, 2024, pp 751-782 from Springer

Abstract: Abstract Most optimization problems one encounters in reference books such as this can be, and are generally, formulated as mathematical programming (MP) problems. For some problems, the modeling requires deep insights into mathematical programming techniques or the way the variables of the problems interact with one another. Such exercises, however, involved at the end, yield mathematical programming formulations that have well defined methods for their solution. These solution methods may themselves be complex and require a good understanding of calculus as well as numerical techniques. Often these methods are computationally expensive and in itself requires go-around tools. However, there are some optimization problems that arise in engineering that cannot be formulated as mathematical programming problems. Often these require external procedure-based declarations to evaluate the system performances or define interactions between various subparts of the problem. Such problems are often solved using optimization metaheuristics like genetic algorithms that are structurally quite versatile and typically require information on only system performance to drive the optimization process. In this chapter the simple everyday problem of efficient urban mobility is introduced as an example that poses unique difficulties when modeled as an optimization problem. The question that is sought to be answered is whether a combination of one-way and two-way roads can be obtained such that an urban area provides the least travel time to its users. This chapter presents a formulation as well as a genetic algorithm-based solution methodology for the problem.

Keywords: Transportation; Urban network design; Genetic algorithm; Metaheuristic (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-981-99-5491-9_25

Ordering information: This item can be ordered from
http://www.springer.com/9789819954919

DOI: 10.1007/978-981-99-5491-9_25

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().