Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem (Q1652109): Difference between revisions

@@ Property / cites work @@
+Exact formulations and algorithm for the train timetabling problem with dynamic demand
+Normal rank
@@ Property / cites work @@
+A procedure to adjust transit trip departure times through minimizing the maximum headway
+Normal rank
@@ Property / cites work @@
+Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
+Normal rank
@@ Property / cites work @@
+The demand-dependent optimization of regular train timetables
+Normal rank
@@ Property / cites work @@
+A methodology for generation of optimal schedules for an underground railway system
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm using adaptive random search
+Normal rank
@@ Property / cites work @@
+Estimating bus passenger waiting times from incomplete bus arrivals data
+Normal rank
@@ Property / cites work @@
+An optimization to schedule train operations with phase-regular framework for intercity rail lines
+Normal rank
@@ Property / cites work @@
+Modelling and optimization of average travel time for a metro line by simulation and response surface methodology
+Normal rank
@@ Property / cites work @@
+Stochastic adaptive search for global optimization.
+Normal rank