Content area
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.
Details
Subject
Business indexing term
Title
Transit System with Rectangular Service Zone
Author
Li, Xiaolin 1 ; Zhang, Junling 2 ; Chen, Ming-Li 3
1 is an instructor at the School of Intelligent Manufacturing, Weifang University of Science and Technology, Weifang 262799, China
2 is an Associate Professor at the School of Intelligent Manufacturing, Weifang University of Science and Technology, Weifang 262799, China
3 is an Associate Professor in the School of Intelligent Manufacturing, Weifang University of Science and Technology, Shandong, China
1 is an instructor at the School of Intelligent Manufacturing, Weifang University of Science and Technology, Weifang 262799, China
2 is an Associate Professor at the School of Intelligent Manufacturing, Weifang University of Science and Technology, Weifang 262799, China
3 is an Associate Professor in the School of Intelligent Manufacturing, Weifang University of Science and Technology, Shandong, China
Volume
55
Issue
9
Pages
2871-2880
Number of pages
11
Publication year
2025
Publication date
Sep 2025
Place of publication
Hong Kong
Country of publication
China
Publication subject
ISSN
1992-9978
e-ISSN
1992-9986
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
ProQuest document ID
3250127617
Document URL
https://www.proquest.com/scholarly-journals/transit-system-with-rectangular-service-zone/docview/3250127617/se-2?accountid=208611
Copyright
© 2025. This work is published under https://creativecommons.org/licenses/by-nc-nd/4.0/ (the"License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-10-07
Database
ProQuest One Academic