Open Access
MATEC Web Conf.
Volume 294, 2019
2nd International Scientific and Practical Conference “Energy-Optimal Technologies, Logistic and Safety on Transport” (EOT-2019)
Article Number 04004
Number of page(s) 6
Section Modern Technologies of Organization of International Transportations and Logistics
Published online 16 October 2019
  1. Bräysy O., Gendreau M.: Vehicle Routing Problem with Time Windows, Part II: Metaheuristics, Transportation Science, Institute for Operations Research and the Management Sciences, Volume 39 Issue 1, pp. 119-139, USA 2005. [Google Scholar]
  2. Burkard R., Dell’Amico M., Marttello S.: Assignment problems Society for Industrial and Applied Mathematics, Philadelphia 2009. [Google Scholar]
  3. Etschmaier M. M., Mathaisel D. F. X.: Airline Scheduling: An Overview, Volume 19, Issue 2, page 127-138, Transportation Science (1985). [CrossRef] [Google Scholar]
  4. Harper P. R., Senna V., Vieria I. T., Shahani A. K.: A genetic algorithm for the project assignment problem, Computers Ops Res. 32, pp, 1225-1265, 2005. [CrossRef] [Google Scholar]
  5. Jacyna M. Cargo flow distribution on the transportation network of the national logistic system. International Journal of Logistics Systems and Management, 2013 pp. 197-218. [CrossRef] [Google Scholar]
  6. Jacyna M. The role of the cargo consolidation center in urban logistics system. International Journal of Sustainable Development and Planning, 2013, pp.100-113 [CrossRef] [Google Scholar]
  7. Jacyna M., Izdebski M., Szczepański E., Gołda P.: The task assignment of vehicles for a production company, w: Symmetry-Basel, Vol. 11, nr 10, 2018, ss. 1-19, DOI: 10.3390/sym10110551 [Google Scholar]
  8. Jacyna-Gołda I.: Inżynieria oceny efektywności sieci dostaw. Wydawnictwo Naukowe PWN, ISBN: 97883-012-0526-3, Warszawa 2019. [Google Scholar]
  9. Jacyna-Gołda Ilona, Izdebski Mariusz, Podviezko Askoldas: Assessment of the efficiency of assignment of vehicles to tasks in supply chains: A case-study of a municipul company, w: Transport, Vol. 32, nr 3, 2017, ss. 243-251 [Google Scholar]
  10. Klincewicz J. G., Rosenwein M. B.: The Airline Exception Scheduling Problem, Volume 29, Issue 1, pp. 4-16, Transportation Science (1995). [CrossRef] [Google Scholar]
  11. Lohatepanont M., Barnhart C.: Airline Schedule Planning: Integrated Models and Algorithms for Schedule Design and Fleet Assignment, Volume 38, Issue 1, pp. 19-32, Transportation Science (2004). [CrossRef] [Google Scholar]
  12. Pentico D., W.: Assignment problems: A golden anniversary survey, European Journal of Operational Research, Volume 176, Issue 2, 2007, pp. 774-793. [CrossRef] [Google Scholar]
  13. Rexing B., Barnhart C., Kniker T., Jarrah A., Krishnamurthy N.: Airline Fleet Assignment with Time Windows, Volume 34, Issue 1, pp. 1-20, Transportation Science (2000). [CrossRef] [Google Scholar]
  14. Schaefer A. J., Johnson E. L., Kleywegt A. J., Nemhauser G. L.: Airline Crew Scheduling Under Uncertainty, Volume 39, Issue 3, pp. 340-348, Transportation Science (2005). [CrossRef] [Google Scholar]
  15. Wasiak M., Jacyna M., Lewczuk K., Szczepański E.: The method for evaluation of efficiency of the concept of centrally managed distribution in cities, Transport, Vol. 32, is 4, 2017, pp.348-357; [CrossRef] [Google Scholar]
  16. Wilson J. M.: A genetic algorithm for the generalized assignment problem, Journal of the Operational Research Society, Vol: 48, pp. 804-809, 1997. [CrossRef] [Google Scholar]
  17. Yen J. W., Birge J. R.: A Stochastic Programming Approach to the Airline Crew Scheduling Problem, Volume 40, Issue 1, page 3-14, Transportation Science (2006). [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.