Optimization of urban transport; an alternative to checkerboard towns plans

被引：1

作者：

Hernandez-Lopez, Eymard ^{[1
]}

Wences, Giovanni ^{[2
]}

机构：

[1] Tecnol Estudios Super Oriente Estado Mexico Posgr, San Isidro S-N, Tecamachalco 56400, Los Reyes Acaqu, Mexico

[2] Univ Autonoma Guerrero, Escuela Super Matemat 2, Av Delicias S-N, Ciudad Altamirano 40660, Guerrero, Mexico

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2023年 / 15卷 / 07期

关键词：

Urban transport; ramified optimal transport; heuristic algorithms; nonparametric test; MODEL;

D O I：

10.1142/S1793830922501567

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we established a precedent to provide urban planning alternatives, given that in modern mobility problems, it is difficult to provide a corrective solution. The proposal of this work focuses on finding preventive rather than remedial solutions, although in particular cases, it may be applicable. We simulated town design situations with optimal ramified transport and metaheuristic optimization methods. For this purpose, it was necessary to analyze the essential aspects of road transportation and traffic problems in the world's leading cities, considering the hypodamic planes proposed in antiquity and contrasting their properties with optimal ramified transportation.

引用

页数：20

共 20 条

[1]

Bernot M, 2009, LECT NOTES MATH, V1955, P1, DOI 10.1007/978-3-540-69315-4

[2] A model for the optimal planning of an urban area [J].

Buttazzo, G ;

Santambrogio, F .

SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2005, 37 (02) :514-530

[3]

Buttazzo G., 2009, LECT NOTES MATH

[4]

Buttazzo G, 2006, ADV MECH MATH, V12, P13

[5] A Mass Transportation Model for the Optimal Planning of an Urban Region [J].

Buttazzo, Giuseppe ;

Santambrogio, Filippo .

SIAM REVIEW, 2009, 51 (03) :593-610

[6]

Federal Housing Administration, 1938, UND VAL PROC TITL 2

[7] Dynamic programming for minimum steiner trees [J].

Fuchs, B. ;

Kern, W. ;

Moelle, D. ;

Richter, S. ;

Rossmanith, Peter ;

Wang, X. .

THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) :493-500

[8]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[9]

Kantorovich L.V., 1948, Usp. Mat. Nauk, V3, P225

[10]

Kantorovitch L, 1942, CR ACAD SCI URSS, V37, P199

← 1 2 →