楼主: Rita2029
173 0

[其他] Modeling and Optimization in Green Logistics [推广有奖]

  • 0关注
  • 0粉丝

已卖:181份资源

学科带头人

52%

还不是VIP/贵宾

-

威望
0
论坛币
57 个
通用积分
98.1142
学术水平
12 点
热心指数
43 点
信用等级
9 点
经验
29597 点
帖子
1597
精华
0
在线时间
876 小时
注册时间
2024-1-22
最后登录
2026-1-22

楼主
Rita2029 发表于 2025-1-26 17:58:26 |AI写论文

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
Modeling and Optimization in Green Logistics
Department of Quantitative Methods and CS University of Carthage
Nabeul, Tunisia


textbook:Modeling and Optimization in Green Logistics
Author(s): Houda Derbel

Description:
This coursebook presents recent work that analyzes general issues of green logistics and smart cities. The contributed chapters consider operating models with important ecological, economic, and social objectives.
The coursebook comprises green logistics systems including optimization models in the scope of the term. To that purpose, a literature review on routing problems and transportation is included to understand the different characteristics of green-vehicle routing problems. Then, new optimization approaches dealing with interesting aspects for sustainable supply chains with a view to reducing negative impacts on transportation and ensuring sustainability are exposed.
The main concern of this coursebook is to present green transportation from both optimization and operational points of view. In addition to an exhaustive overview, the book investigates the use of operation research and optimization techniques for considering environmental issues within transportation logistics problems and solving different variants of green routing problems. It covers different ranges of problems and applications and emphasizes the green optimization logistics side.




Modeling and Optimization in Green Logistics- (2021).pdf (3.89 MB, 需要: RMB 19 元)

二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:Optimization LOGISTICS logistic Modeling logisti

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
扫码
拉您进交流群
GMT+8, 2026-1-24 12:57