Solve cost minimizing line planning problem

solve line planning problem by minimizing operational costs.

computational task	linear task

Available identifiers

line concept	$(ℒ, f_{l})$	output
	$ℒ$ represents public transport route
	$f_{l}$ represents frequency of line

line costs	input
line pool	input
integer problem line planning costs	$\begin{matrix} m i n \sum_{l \in ℒ} c o s t_{l} \cdot f_{l} \\ s . t . f_{e}^{m i n} \leq \sum_{l \in ℒ : e \in l} f_{l} \leq f_{e}^{m a x} \forall e i n E \\ f_{l} \in ℤ \forall l \in ℒ \end{matrix}$
	$ℒ$ represents line pool
	$f_{l}$ represents frequency of line
	$f_{e}^{m i n}$ represents minimum frequency of line
	$l$ represents public transport line
	$c o s t_{l}$ represents line costs
	$e$ represents edge
	$f_{e}^{m a x}$ represents maximum frequency of line
	$E$ represents edge set

Item	Property
cost model for line concept	used by

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