An exact second order cone programming approach for traffic assignment problems

¹ TED University, Department of Industrial Engineering, Kolej, Çankaya, 06420 Ankara, Turkey
² University of Kent, Kent Business School, Department of Analytics, Operations and Systems, Centre for Logistics and Sustainability Analytics, Canterbury, Kent CT2 7NZ, UK

^* Corresponding author: v.bayram@kent.ac.uk

Received: 7 May 2023
Accepted: 24 October 2023

Abstract

Demographic changes, urbanization and increasing vehicle ownership at unprecedented rates put a lot of strain on cities particularly on urban mobility and transportation and overwhelm transportation network infrastructures and current transportation systems, which are not built to cope with such a fast increasing demand. Traffic congestion is considered as the most difficult challenge to tackle for sustainable urban mobility and is aggravated by the increased freight activity due to e-commerce and on-demand delivery and the explosive growth in transportation network companies and ride-hailing services. There is a need to implement a combination of policies to ensure that increased urban traffic congestion does not lower the quality of life and threaten global climate and human health and to prevent further economic losses. This study aims to contribute to the United Nations (UN) climate action and sustainable development goals in tackling recurring traffic congestion problem in urban areas to achieve a sustainable urban mobility in that it offers a solution methodology for traffic assignment problem. We introduce an exact generalized solution methodology based on reformulation of existing traffic assignment problems as a second order cone programming (SOCP) problem and propose column generation (CG) and cutting plane (CP) algorithms to solve the problem effectively for large scale road network instances. We conduct numerical experiments to test the performance of the proposed algorithms on realistic road networks.