Solve cost minimizing line planning problem

solve line planning problem by minimizing operational costs

computational task, linear task

MaRDI QIDQ6823145FDOCommunityMathModDB

Contained entities

line concept	$(ℒ,f_l)$	output
	$ℒ$ represents public transport route
	$f_l$ represents frequency of line
line pool		input
line costs		input
integer problem line planning costs	$\begin{array}{c}min\sum _{l\in ℒ}cos{t}_l\cdot f_l\\ s.t.f_e^{min}\le \sum _{l\in ℒ:e\in l}{f}_l\le f_e^{max}\mathrm{\forall }einE\\ f_l\in \mathbb{Z}\mathrm{\forall }l\in ℒ\end{array}$
	$ℒ$ represents line pool
	$f_l$ represents frequency of line
	$f_e^{min}$ represents minimum frequency of line
	$l$ represents public transport line
	$cos{t}_l$ represents line costs
	$e$ represents edge
	$f_e^{max}$ represents maximum frequency of line
	$E$ represents edge set

Further links

Item	Property
cost model for line concept	used by

---

---

Edit solve cost minimizing line planning problem item

This page was built for task: solve cost minimizing line planning problem