IDEAS home Printed from https://ideas.repec.org/a/scn/cememm/v55y2019i2p58-64.html
   My bibliography  Save this article

О Транспортной Задаче С Экологическим Критерием

Author

Listed:
  • Ассаул В.Н.*
  • Погодин И.Е.**

Abstract

ВМПИ ВУНЦ ВМФ ВМА, Санкт-Петербург * E-mail: vicvic21@yandex.ru ** E-mail: iepogodin@mail.ru Авторы благодарны И.А. Барсуку за создание условий для осуществления необходимых вычислений, А.И. Поповой за помощь в оформлении, а также Р.И. Мусатенко за идею экологического подхода. Аннотация. Рассматривается решение транспортной задачи, в которой, помимо платы за провоз каждой единицы груза, с перевозчика дополнительно взимается фиксированная плата за использование трассы вне зависимости от количества перевозимого по ней груза. Приведены три решения этой задачи: 1) детальный логический анализ матрицы платежей с построением дерева, учитывающего корректирующие циклы; при этом рассматриваются поставки во все незаполненные клетки и отбираются приводящие к уменьшению целевой функции; 2) выбор наилучшего плана из совокупности итерационных вариантов, в каждом из которых стоимости перевозок по используемым трассам (клеткам) заменяются фактическими, т.е. пересчитанными с учетом добавок к исходным стоимостям перевозок дополнительных штрафных добавок, приведенных к единице груза, перевозимого по соответствующей трассе на предыдущей итерации; 3) приближенное сведение двухкомпонентных стоимостей к эффективным непрерывным величинам удельных стоимостей перевозок, которые моделируют скачкообразный вклад дополнительных доплат, и дальнейшим сведением задачи к поиску экстремума целевой функции как функции нескольких переменных. Делаются оценки условий, при которых задача с необходимостью требует учета дополнительных платежей по трассам. Поскольку такая постановка задачи не имела единого термина, то с учетом современных условий авторы предложили назвать ее "транспортной задачей с экологическим критерием".

Suggested Citation

  • Ассаул В.Н.* & Погодин И.Е.**, 2019. "О Транспортной Задаче С Экологическим Критерием," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 55(2), pages 58-64, апрель.
    • Handle: RePEc:scn:cememm:v:55:y:2019:i:2:p:58-64
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Michel L. Balinski, 1961. "Fixed‐cost transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 8(1), pages 41-54, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    2. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    3. Aghalari, Amin & Nur, Farjana & Marufuzzaman, Mohammad, 2020. "A Bender’s based nested decomposition algorithm to solve a stochastic inland waterway port management problem considering perishable product," International Journal of Production Economics, Elsevier, vol. 229(C).
    4. Fernández, Elena & Hinojosa, Yolanda & Puerto, Justo & Saldanha-da-Gama, Francisco, 2019. "New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation," European Journal of Operational Research, Elsevier, vol. 277(1), pages 215-226.
    5. Aghalari, Amin & Nur, Farjana & Marufuzzaman, Mohammad, 2021. "Solving a stochastic inland waterway port management problem using a parallelized hybrid decomposition algorithm," Omega, Elsevier, vol. 102(C).
    6. Haeringer, Guillaume, 2023. "Minimizing settlements," Journal of Mathematical Economics, Elsevier, vol. 106(C).
    7. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    8. Ovidiu Cosma & Petrică C. Pop & Cosmin Sabo, 2020. "An Efficient Hybrid Genetic Approach for Solving the Two-Stage Supply Chain Network Design Problem with Fixed Costs," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    9. Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.
    10. A. Karakitsiou & A. Migdalas, 2016. "Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method," Operational Research, Springer, vol. 16(3), pages 401-421, October.
    11. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    12. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    13. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    14. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    15. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:scn:cememm:v:55:y:2019:i:2:p:58-64. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sergei Parinov (email available below). General contact details of provider: http://www.cemi.rssi.ru/emm/home.htm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.