Transit System with Rectangular Service Zone

Збережено в:

Бібліографічні деталі
Опубліковано в::	IAENG International Journal of Applied Mathematics vol. 55, no. 9 (Sep 2025), p. 2871-2881
Автор:	Li, Xiaolin
Інші автори:	Zhang, Junling, Chen, Ming-Li
Опубліковано:	International Association of Engineers
Предмети:	Lower bounds Iterative algorithms Service areas Upper bounds Transit Researchers College professors Algorithms Manufacturing Iterative methods
Онлайн доступ:	Citation/Abstract Full Text - PDF
Теги:	Додати тег Немає тегів, Будьте першим, хто поставить тег для цього запису!

Опис
Короткий огляд:	Abstract-We study a deterministic model of a transit system with a rectangular service area to develop a new solution approach. We first point out that sometimes the iterative algorithm may be convergent to a point that is not the wanted solution. We construct an upper bound and a lower bound to run the bisection method that will converge to the optimal solution. The same numerical example used in two previously published papers was adopted by us to demonstrate that our solution approach is effective and efficient. Our paper will help researchers develop their solution algorithms.
ISSN:	1992-9978 1992-9986
Джерело:	Computer Science Database